开始刷leetcode day47: Word Break
来源:互联网 发布:淘宝上下架时间在哪里 编辑:程序博客网 时间:2024/05/02 13:57
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 = "leetcode"
,
dict = ["leet", "code"]
.
Return true because "leetcode"
can be segmented as "leet code"
.
Java:
public class Solution {
public boolean wordBreak(String s, Set<String> wordDict) {
boolean[] array = new boolean[s.length()+1];
array[0] = true;
for(int i=0; i<s.length(); i++)
{
for(int j=0; j<=i;j++)
{
if(array[j] && wordDict.contains(s.substring(j, i+1)))
{
array[i+1] = true;
break;
}
}
}
return array[s.length()];
}
}
- 开始刷leetcode day47: Word Break
- 开始刷leetcode day47:Gray Code
- 开始刷题leetcode day47: Longest Palindromic Substring
- leetcode Word Break & Word Break ||
- LeetCode刷题笔录Word Break
- LeetCode刷题笔录Word Break II
- LeetCode刷题笔录Word Break II
- Leetcode刷题之Word Break
- Leetcode: Word Break
- [leetcode]Word Break
- [leetcode]Word Break II
- LeetCode:Word Break
- LeetCode:Word Break II
- Leetcode: Word Break II
- [LeetCode] Word Break
- [LeetCode] Word Break II
- LeetCode: Word Break
- leetcode之Word Break
- QT实现,通过URL下载文件的接口实现
- 微信公众平台开发:OAuth2.0网页授权
- Yahoo!团队:网站性能优化的35条黄金守则
- centos 安装 pear
- 递归函数的经典例子(汉诺塔问题)
- 开始刷leetcode day47: Word Break
- (ros/topic_tools): mux 话题的多路切换开关
- C++学习笔记__类的派生和多态性
- MD5加密字符串
- 简单理解动态内存分配和静态内存分配的区别
- hdu2422考研路茫茫——空调教室 tarjan+树形dp
- maven parent中的dependencies和dependencyManagement区别
- 黑马程序员_异常
- 多线程知识点3