[Leetcode] Word Break
2014-07-23 02:23
459 查看
//DP，先设置n+1个模板，然后依次判断是否可以在每个位置断开
class Solution {
public:
bool wordBreak(string s, unordered_set<string> &dict) {
int m=dict.size();
if(m==0)return false;
int n=s.size();
vector<bool> f(n+1,false);
f[0]=true;
for(int i=1;i<=n;i++)
for(int j=0;j<=i-1;j++)
{
if(f[j]&&(dict.find(s.substr(j,i-j))!=dict.end()))
f[i]=true;
}
return f
;
}
};
class Solution {
public:
bool wordBreak(string s, unordered_set<string> &dict) {
int m=dict.size();
if(m==0)return false;
int n=s.size();
vector<bool> f(n+1,false);
f[0]=true;
for(int i=1;i<=n;i++)
for(int j=0;j<=i-1;j++)
{
if(f[j]&&(dict.find(s.substr(j,i-j))!=dict.end()))
f[i]=true;
}
return f
;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode: Word Break
- [Leetcode 139, medium] Word Break
- [leetcode]Word Break
- leetcode 139. Word Break
- LeetCode _ Word Break
- （leetcode)Word Break
- leetcode 139. Word Break
- Leetcode题解 - 139. Word Break
- [LeetCode] Word Break
- leetcode:Word Break
- LeetCode-Word Break
- [LeetCode] Word Break, Solution
- [LeetCode] 139 Word Break（BFS统计层数的方法）
- [LeetCode]Word Break
- leetcode 139 Word Break(阿里测试岗笔试题)
- [LeetCode]Word Break
- leetcode 139. Word Break
- LeetCode-Word Break
- 【Leetcode】139. Word Break
- Leetcode 139 Word Break