title
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.
Note:
The same word in the dictionary may be reused multiple times in the segmentation. You may assume the dictionary does not contain duplicate words.
Example 1:
Input: s = "leetcode", wordDict = ["leet", "code"]
Output: true
Explanation: Return true because “leetcode” can be segmented as “leet code”.
Example 2:
Input: s = "applepenapple", wordDict = ["apple", "pen"]
Output: true Explanation: Return true because "applepenapple" can be segmented as "apple pen apple".
Note that you are allowed to reuse a dictionary word.
Example 3:
Input: s = "catsandog", wordDict = ["cats", "dog", "sand", "and", "cat"]
Output: false
solution
完全背包问题
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
int n = s.length();
bool *dp = new bool[n + 1];
fill(dp, dp + n + 1, false);
dp[0] = true;
for (int i = 1; i <= n; i++) {
for (string str : wordDict) {
int len = str.length();
if (len <= i && str == s.substr(i - len, len)) {
dp[i] = dp[i] || dp[i - len];
}
}
}
return dp[n];
}
};