LeetCode – Refresh – Word Break
2015-03-25 08:18
253 查看
Differentiate it with Palindrome min cut!!!!!!!!!
class Solution {
public:
bool wordBreak(string s, unordered_set<string> &dict) {
int len = s.size();
if (len == 0) return false;
vector<bool> dp(len+1, false);
dp[0] = true;
for (int i = 1; i <= len; i++) {
for (int j = i-1; j >= 0; j--) {
if (dp[j] && dict.find(s.substr(j, i-j)) != dict.end()) {
dp[i] = true;
}
}
}
return dp[len];
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode – Refresh – 3sumclosest
- LeetCode – Refresh – Binary Tree Pre Order Traversal
- LeetCode – Refresh – Convert Sorted Array to Binary Search Tree
- LeetCode – Refresh – Gray Code
- LeetCode – Refresh – Letter Combination of a Phone Number
- leetcode：Word Break
- LeetCode – Refresh – Min Stack
- LeetCode | Word Break
- LeetCode - Refresh - Path Sum
- LeetCode – Refresh – Regular Expression Matching
- LeetCode - Refresh - Rotate Array
- LeetCode - Refresh - Set Matrix Zeroes
- LeetCode – Refresh – Triangle
- [Leetcode]Word Break
- leetcode-word break-ZZ
- 【leetcode】Word Break(java)
- [LeetCode] Word Break
- LeetCode(139)Word Break
- LeetCode - Word Break
- 139 Word Break [Leetcode]