Given a non-empty string s and a dictionary wordDict containing a list of non-emptywords, 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"
给定一个字符串和一个字典,判断字符串是否能通过该字典中的字符串进行拼接而成。
刚开始的时候,想着用递归一点点去试,但是超时了。我们仔细分析一下题目,对于从0到i的字符串,如果其中存在0到j的子串可以被字典中的元素组成,且从j+1到i的子串也可以在字典中找到,则从0到i的字符串可以被字典中的元素拼接。因此,对于长度为length的字符串,我们构造一个大小为length+1的数组dp并设其第一个元素为true,从第1个元素开始,我们判断其子串中是否有满足dp[j]为true且从j到i的串也可在字典中找到,若满足条件,则dp[i]为true。最终dp中的第length个元素的状态即为字符串能否被字典中的元素拼成的结果。代码记录如下:
bool wordBreak(string s, vector<string>& wordDict) {
int length = s.length();
vector<bool> dp(length + 1, false);
dp[0] = true;
for(int i = 1; i < length + 1; i++)
{
for(int j = i - 1; j >= 0; j--)
{
if (dp[j] && find(wordDict.begin(), wordDict.end(), s.substr(j, i-j)) != wordDict.end()) {
dp[i] = true;
break; //break when finded the element at j meets the condition
}
}
}
return dp[length];
}