[LeetCode]Word Break
2013-11-20 14:07
281 查看
class Solution {
public:
bool wordBreak(string s, unordered_set<string> &dict) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int n = s.size();
vector<bool> f(n+1, false);
f[0] = true;
for(int i = 1; i <= n; ++i)
{
for(int k = 0; k < i; ++k)
{
f[i] = f[k] && (dict.find(s.substr(k, i-k)) != dict.end());
if(f[i]) break;
}
}
return f
;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode] word break 字符串的划分
- [LeetCode] Word Break
- 【LeetCode】Word Break
- [LeetCode]Word Break
- [LeetCode]题解（python）：139-Word Break
- leetcode[139] Word Break
- leetcode-139-Word Break
- [LeetCode] Word Break
- LeetCode - 139/140 - Word Break
- 【Leetcode】139. Word Break
- [Leetcode] Word Break (Java)
- LeetCode-Word Break
- [LeetCode]Word Break 字典树
- leetcode -- Word Break
- Leetcode 139. Word Break
- [Leetcode] Word Break
- LeetCode --Word Break
- Leetcode--Word Break
- 【LeetCode-面试算法经典-Java实现】【139-Word Break（单词拆分）】
- Leetcode Solution – Word Break