[leetcode]139. Word Break
来源:互联网 发布:javascript # 编辑:程序博客网 时间:2024/06/08 18:53
题目链接:https://leetcode.com/problems/word-break/#/description
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"
.
class Solution{public: bool wordBreak(string s, vector<string> &dict) { if(dict.size()==0) return false; vector<bool> dp(s.size()+1,false); dp[0]=true; for(int i=1;i<=s.size();i++) { for(int j=i-1;j>=0;j--) { if(dp[j]) { string subString=s.substr(j,i-j); if(find(dict.begin(),dict.end(),subString)!=dict.end()) { dp[i]=true; //break; } } } } return dp[s.size()]; }};
阅读全文
0 0
- 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
- leetcode 139. Word Break
- Javascript基础笔记——入门篇
- acm 香港网赛 C题 Classrooms
- Java常见的RuntimeException
- Linux Kernel之do{}while(0)
- C#通用JSON操作类
- [leetcode]139. Word Break
- 数组的复制
- vi 命令
- 2015 香港网络赛 F题
- jenkins新手学习小结
- JAVA——IO流 之 处理流之打印流:PrintStream与printWriter(3)
- 架构师反向代理Haproxy+压力测试
- Hibernate(一):Hibernate基本原理
- A*寻路(一) 顽皮猫详解A*算法的工作原理