题目描述:
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. 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[i]表示s[0:i]是否可以分词为dict中的词,那么有两种情况:1.s[0:i]为dict中元素,则dp[i]=true;2.对于任意j<i,如果dp[j]=true且s[j:i]是dict中的元素,则dp[i]=true。
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
vector<bool> dp(s.length(),false);
for(int i=0;i<dp.size();i++)
{
if(find(wordDict.begin(),wordDict.end(),s.substr(0,i+1))!=wordDict.end())
{
dp[i]=true;
}
else
{
for(int j=0;j<i;j++)
{
if(dp[j]==true&&find(wordDict.begin(),wordDict.end(),s.substr(j+1,i-j))!=wordDict.end())
{
dp[i]=true;
break;
}
}
}
}
return dp[dp.size()-1];
}
};