[Leetcode] Word Break (Java)

最新推荐文章于 2024-09-22 04:59:47 发布

草鞋大脚

最新推荐文章于 2024-09-22 04:59:47 发布

阅读量960

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/StarCXDJ/article/details/19287829

版权

Leetcode 专栏收录该内容

150 篇文章 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".

判断能不能被dict中单词拆分

已经长过见识了，DFS应该会超时，直接试DP

public class Solution {
    public boolean wordBreak(String s, Set<String> dict) {
        
        boolean[] dp = new boolean[s.length()];
        
		for(int i=0;i<s.length();i++){
			if(dict.contains(s.subSequence(0, i+1)))
				dp[i]=true;
		}
		
		for(int j=1;j<s.length();j++){
			for(int k=0;k<j;k++){
				if(dp[k]&&dict.contains(s.subSequence(k+1, j+1))){
					dp[j]=true;
					break;
				}
			}
		}
		return dp[s.length()-1];
    }
}