LeetCode 139. Word Break 字符串 DP

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may assume the dictionary does not contain duplicate words.

For example, given
s = “leetcode”,
dict = [“leet”, “code”].

Return true because “leetcode” can be segmented as “leet code”.

题目链接

题目描述
给定一个单词s，和字典dict，看是否可以通过dict中的单词拼接出来。
思路
这个题目错了好多遍。使用dp[i]代表从s[i]到末尾能否用dict中的单词表示，这就注定我们要尾部来遍历。

public class WordBreak {
    public boolean wordBreak(String s, Set<String> dict) {
        boolean[] dp = new boolean[s.length()+1]; 
        Arrays.fill(dp, false);
        dp[s.length()] = true; 
        for ( int i=s.length()-1; i>=0; i-- ) { //！！
            for ( int j=s.length()-1; j>=i; j-- ) {
                String t = s.substring(i, j+1); 
                if ( dict.contains(t) && dp[j+1] ) {
                    dp[i] = true ; 
                    break; 
                }
            }
        }
        return dp[0]; 
    }
}