原题:
解决方法:
代码:
Given a non-empty string s and a dictionary wordDict containing a list ofnon-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may assume the dictionary does not contain duplicate words.
For example, given
s = "leetcode"
,
dict = ["leet", "code"]
.
Return true because "leetcode"
can be segmented as "leet code"
.
UPDATE (2017/1/4):
The wordDict parameter had been changed to a list of strings (instead of a set of strings). Please reload the code definition to get the latest changes.
解决方法:
试了很多办法,最后发现DP是最简单的。dp[i]表示到第i个字符是否能切割,结果就是求dp[n]。
对i个字符,如果前面j个字符能够切割,而且从j到i的字符串也能切割,则dp[i]可以切割。
代码:
bool wordBreak(string s, vector<string>& wordDict) {
unordered_set<string> st(wordDict.begin(), wordDict.end());
int n = s.size();
vector<bool> dp(n+1, false);
dp[0] = true;
for(int i = 1; i <= n; i++){
for(int j = i -1; j >= 0; j--){
if (!dp[j])
continue;
string word = s.substr(j, i -j);
if (st.count(word)){
dp[i] = true;
break;
}
}
}
return dp[n];
}