139. Word Break

题目链接：https://leetcode.com/problems/word-break/

Given a non-empty string s and a dictionary wordDict containing a list of non-emptywords, 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

DP的递推式为:(i>j)

dp[i]=dp[j]&&dp[dict.contains(s[i,j])];

AC:

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