Problem:
Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words. See following examples for more details. Consider the following dictionary
{ i, like, sam, sung, samsung, mobile, ice,cream, icecream, man, go, mango}
Input: ilike
Output: Yes
The string can be segmented as “i like”.
Input: ilikesamsung
Output: Yes
The string can be segmented as “i like samsung” or “i like sam sung”.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 |
#include <stdio.h> #include <iostream> #include <string> #include <cstring> /* 12 mobile samsung sam sung man mango icecream and go i like ice cream ilike */ using namespace std; string dic[18]; bool dp[1005]; int n; bool wordFound(string s) { for(int i=0;i<n;i++) if(dic[i].compare(s)==0) return 1; return 0; } bool wordbreak(string str) { int sz=str.size(); memset(dp,0,sizeof(dp)); for(int i=1;i<=sz;i++) { if(dp[i]==0 && wordFound(str.substr(0,i))==1) dp[i]=1; if(dp[i]==1) { if(i==sz) return 1; for(int j=i+1;j<=sz;j++) { if(dp[j]==0 && wordFound(str.substr(i,j-i))==1) dp[j]=1; if(j==sz && dp[j]==1) return 1; } } } //cout<<dp[sz-1]<<"\n"; return 0; } int main() { //code int t; string str; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=0;i<n;i++) { cin>>dic[i]; } cin>>str; cout<<wordbreak(str)<<"\n"; } return 0; } |