LeetCode 刷题笔记 之 Word Break

题目如下：

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.

Note:

• The same word in the dictionary may be reused multiple times in the segmentation.
• You may assume the dictionary does not contain duplicate words.

Example 1:

Input: s = "leetcode", wordDict = ["leet", "code"]
Output: true
Explanation: Return true because "leetcode" can be segmented as "leet code".

Example 2:

Input: s = "applepenapple", wordDict = ["apple", "pen"]
Output: true
Explanation: Return true because "applepenapple" can be segmented as "apple pen apple".
             Note that you are allowed to reuse a dictionary word.

Example 3:

Input: s = "catsandog", wordDict = ["cats", "dog", "sand", "and", "cat"]
Output: false

解答如下：

第一个想法就是用动态规划。但是这个题的转移条件很难想：dp[i]=dp[j]&&(dict.contains(s.substring(j,i)));

然后代码：

class Solution {
    public boolean wordBreak(String s, List<String> wordDict) {
        int len=s.length();
        boolean dp[]=new boolean[len+1];
        dp[0]=true;
        for(int i=1;i<len+1;i++){
            for(int j=0;j<i;j++){
                String tmp=s.substring(j,i);
                if(dp[j]&&wordDict.contains(tmp)){
                    dp[i]=true;
                    break;
                }
            }
        }
        return dp[len];
    }
}