LeetCode139.单词拆分
思路:
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
unordered_set<string> wordset(wordDict.begin(), wordDict.end());
vector<bool> dp(s.size() + 1, false);
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);//substr(起始位置,截取的个数)
if(wordset.find(word) != wordset.end() && dp[j]) {
dp[i] = true;
}
}
}
return dp[s.size()];
}
};