LeetCode 139. Word Break (Medium)
来源:互联网 发布:快乐大本营知乎 编辑:程序博客网 时间:2024/05/26 02:21
题目描述:
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may assume the dictionary does not contain duplicate words.
Example:
s = "leetcode",dict = ["leet", "code"].Return true because "leetcode" can be segmented as "leet code".
题目大意:给出一个字符串,给出一个字符串数组(字典),问字符串是否能分解为字典里的字符串。
思路:暴力做法当然是遍历所有子字符串组合,显然时间复杂度太高。从网上看到可以动态规划,学习了一下。大概思路是:假如前i个字符可以切分(由字典的字符串组成),那看看前i - j个字符能否被切分,如果可以就继续。复杂度貌似是O(n^2)。
c++代码:
class Solution {public: bool wordBreak(string s, vector<string>& wordDict) { vector<bool> dp(s.size() + 1, false); dp[0] = true; for (int i = 1; i < s.size() + 1; i++) { for (int j = i - 1; j >= 0; j--) { if (dp[j] && find(wordDict.begin(), wordDict.end(), s.substr(j, i - j)) != wordDict.end()) { dp[i] = true; break; } } } return dp[s.size()]; }};
阅读全文
0 0
- LeetCode 139. Word Break (Medium)
- Leetcode 139. Word Break (Medium) (cpp)
- 【Medium】139. Word Break
- 139. Word Break -Medium
- 139. Word Break Medium
- [Leetcode 139, medium] Word Break
- Word Break(medium)
- LeetCode 139. Word Break
- [LeetCode]139.Word Break
- [leetcode] 139.Word Break
- leetcode 139. Word Break
- [LeetCode]139. Word Break
- 139. Word Break LeetCode
- LeetCode-139.Word Break
- LeetCode *** 139. Word Break
- LeetCode 139. Word Break
- LeetCode 139. Word Break
- [leetcode] 139. Word Break
- 数据产品经理如何建设BI平台?
- sql分页语句
- Java实现单链表部分翻转
- AndroidStudio常用快捷键搜集整理
- 关于valuestack
- LeetCode 139. Word Break (Medium)
- 关于左侧菜单栏,点击二级菜单栏展开
- poj1321 DFS
- 【JZOJ 5358】【NOIP2017提高A组模拟9.12】BBQ
- 防火墙搭建及NET机制
- 搜索引擎【渗透神器系列】
- ECJSON格式化工具
- IPython notebook(Jupyter notebook)指定IP和端口运行
- [python]leetcode(72). Edit Distance AND (583). Delete Operation for Two Strings