首页 > 代码库 > [Leetcode] Word Break
[Leetcode] Word Break
Question:
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"
.
-----------------------------------------
Solution:dp
1 public class Solution { 2 public boolean wordBreak(String s, Set<String> dict) { 3 boolean[] state=new boolean[s.length()+1]; 4 state[0]=true; 5 for(int i=1;i<=s.length();i++){ 6 for(int j=i-1;j>=0;j--){ 7 if(state[j]&&dict.contains(s.substring(j, i))){ 8 state[i]=true; 9 break; 10 } 11 } 12 } 13 return state[s.length()]; 14 } 15 }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。