139. 单词拆分
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
vector<bool> dp(s.size()+1,false);
unordered_set<string> wordset(wordDict.begin(),wordDict.end());
dp[0]=true;
for(int i=1;i<=s.size();i++)
{
for(int j=0;j<i;j++)
{
string word=s.substr(j,i-j);
if(wordset.find(word)!=wordset.end()&&dp[j])
{
dp[i]=true;
}
}
}
return dp[s.size()];
}
};