动态规划问题,dp[k]:到k位置是否可以划分成功
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
vector<bool> dp(s.size(), false);
for (int i = 0; i < s.size(); ++i) {
for (auto &x : wordDict)
if (x.size() <= i + 1 && (i + 1 == x.size() || dp[i - x.size()]) && x == string(s, i + 1 - x.size(), x.size())) {
dp[i] = true; break;
}
}
return dp[s.size() - 1];
}
};