LeetCode——word break 字符串切割
题目描述:
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.
For example, given
s =“leetcode”,
dict =[“leet”, “code”].
Return true because"leetcode"can be segmented as"leet code".
给出一个字符串和一个字典,问是否存在一种或多种切割方法使得切出的每个子串都能在字典中找到。
题目分析:
动态规划,如果子串0—m 为true且m—n的子串可以在字典中找到,那么子串0—n为true。返回子串0—s.length()对应的布尔值。
AC代码:
class Solution {
public:
bool wordBreak(string s, unordered_set<string> &dict) {
vector<bool> dp(s.length()+1,false);//长度从0到s.length()
dp[0]=true;//空字符串为true
for(int start=0;start!=s.length();start++)
for(int end=start+1;end<=s.length();end++)
if(
dp[start]&&
find(dict.begin(),dict.end(),s.substr(start,end-start))!=dict.end()
)
dp[end]=true;
return dp[s.length()];
}
};