leetcode-wordbreak

最新推荐文章于 2019-09-22 20:48:14 发布

在云端123

最新推荐文章于 2019-09-22 20:48:14 发布

阅读量374

点赞数 1

分类专栏：数据结构与算法文章标签： string dictionary leetcode

本文链接：https://blog.csdn.net/jyxmust/article/details/77417148

版权

数据结构与算法专栏收录该内容

31 篇文章 0 订阅

订阅专栏

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".

import java.util.Set;
public class Solution {
    public boolean wordBreak(String s, Set<String> dict) {
       if(dict.isEmpty()){
           return false;
       }
        if(s.length()==0){
            return true;
        }
        int[] state=new int[s.length()+1];
        state[0]=1;
            for(int i=1;i<=s.length();i++){
               for(int j=0;j<i;j++){
                    if(state[j]==1&&(dict.contains(s.substring(j,i))==true)){
                         state[i]=1;
                       break;  
                    }
                    
                } 
            }
                
        if(state[s.length()]==1){
            return true;
        }else{
            return false;
        }

    }
}