【C++】【LeetCode】139. Word Break
来源:互联网 发布:红帽linux查看防火墙 编辑:程序博客网 时间:2024/05/18 15:27
题目
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.
For example, given
s = “leetcode”,
dict = [“leet”, “code”].
Return true because “leetcode” can be segmented as “leet code”.
思路
建一个数组用于存到第i个位置为止能不能用wordDict里的词表示出来,能为true,不能为false。当遍历到第i个位置时,检查在它之前的位置j为true或者false,如果为true,则检查从i到j的字符串是不是在wordDict中。
代码
class Solution {public: bool wordBreak(string s, vector<string>& wordDict) { if (wordDict.size() == 0) { return false; } vector<bool> endHere(s.size() + 1, false); endHere[0] = true; for (int i = 1; i <= s.size(); i++) { for (int j = i - 1; j >= 0; j--) { if (endHere[j]) { string word = s.substr(j, i - j); if (find(wordDict.begin(), wordDict.end(), word) != wordDict.end()) { endHere[i] = true; break; } } } } return endHere[s.size()]; }};
阅读全文
0 0
- 【C++】【LeetCode】139. Word Break
- 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
- [leetcode] 139. Word Break
- [LeetCode] 139. Word Break
- [leetcode]139. Word Break
- Leetcode-139. Word Break
- Leetcode-139. Word Break
- Leetcode 139. Word Break
- PHP之chr()和ord()方法
- 关于在项目中引入了第三方库而发生的Multiple dex files define错误的解决
- Android手机短信验证--Bmob短信验证
- Mayor's posters POJ
- ansible之playbook入门
- 【C++】【LeetCode】139. Word Break
- 4个理由告诉你Java为何排行第一
- linux实验楼学习笔记8
- 第六篇:JAVA集合之TreeMap源码剖析
- Android Framework中的Application Framework层介绍
- fluentd分布式日志管理系统
- STL容器
- The Suspects(并查集)
- 固态硬盘