leetcode 148: Word Break

最新推荐文章于 2021-03-11 16:10:14 发布

xudli

最新推荐文章于 2021-03-11 16:10:14 发布

阅读量622

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/xudli/article/details/34791713

版权

leetcode 专栏收录该内容

216 篇文章 0 订阅

订阅专栏

Word Break

Total Accepted: 15458 Total Submissions: 75841

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

public class Solution {
    public boolean wordBreak(String s, Set<String> dict) {
        
        int len = s.length();
        boolean [] d = new boolean[len+1];
        
        d[0] = true;
        
        for(int i=1; i<=len; i++) {
            String sub = s.substring(0,i);
            if( dict.contains(sub) ) {
                d[i] = true;
            } else {
                for(int j=1; j<i; j++) {
                    if( d[j] && dict.contains( s.substring(j, i) )) 
                        d[i] = true;
                }
            }
        }
        
        return d[len];
        
    }
}