1 暴力破解 双重循环
vector<string> wordBreak(string s, unordered_set<string> &dict) {
vector<string> result;
if(s.length()==0)
return result;
for(int i=0;i<s.length();i++){
string strs;
for(int j=i;j<=s.length();j++){
string str=s.substr(i,j-i+1);
if(dict.count(str)){
strs+=str;
strs+=" ";
}
}
result.push_back(strs);
}
return result;
}
2 动态规划
用dp存储子串是否在 字典中
DP[i][j]里:
0 c ca cat(1) cats(1) catsa catsan catsand