[leetcode]139. Word Break

题目链接：https://leetcode.com/problems/word-break/#/description

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented
into a space-separated sequence of one or more dictionary words. You may assume the dictionary does not contain duplicate words.

For example, given
s = 

"leetcode"

,
dict = 

["leet", "code"]

.

Return true because 

"leetcode"

 can be segmented as 

"leet
code"

.

class Solution{
public:
bool wordBreak(string s, vector<string> &dict) {
if(dict.size()==0) return false;

vector<bool> dp(s.size()+1,false);
dp[0]=true;

for(int i=1;i<=s.size();i++)
{
for(int j=i-1;j>=0;j--)
{
if(dp[j])
{
string subString=s.substr(j,i-j);
if(find(dict.begin(),dict.end(),subString)!=dict.end())
{
dp[i]=true;
//break;
}
}
}
}
return dp[s.size()];
}
};