leetcode - Word Break
2014-09-22 00:00
260 查看
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 =
dict =
Return true because
For example, given
s =
"leetcode",
dict =
["leet", "code"].
Return true because
"leetcode"can be segmented as
"leet code".
class Solution {
public:
bool wordBreak(std::string s, std::unordered_set<std::string> &dict) {
int n = (int)s.size();
std::vector<int> dp(n+1,0);
dp[0] = 1;
for(int i = 1; i <= n; i++)
{
if(dp[i-1])
{
int index = i - 1;
for(int j = index; j < n; j++)
{
std::string str = s.substr(index,j-index+1);
if(dict.count(str) > 0)
dp[j+1] = true;
}
}
}
return dp
;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode]Word Break 字典树
- leetcode笔记：Word Break
- leetcode 139. Word Break
- LeetCode——Word Break
- LeetCode 139. Word Break
- LeetCode:Word Break
- Leetcode: Word Break
- [LeetCode] Word Break
- [LeetCode] word break 字符串的划分
- Leetcode -- Word Break
- 【LeetCode】Word Break
- [LeetCode]Word Break
- leetcode[139] Word Break
- [LeetCode] Word Break
- [Leetcode]Word Break
- [leetcode 139]Word Break
- LeetCode-Word Break
- LeetCode-Word Break
- leetcode 139. Word Break
- leetcode-Word Break