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

题意：判断字符串能否被字典中的单词完整翻译。

思路：1）从字符串第一个字符开始，截取一定长度的子字符串subStr；

2）若subStr包含在字典中，则表示当前subStr可翻译成单词

3）若2）满足，且subStr之前的字符串也刚好能被拆分成单词，则在subStr末尾标记当前字符串以前均可被拆分成单词；

4）直到字符串末尾。

代码：

class Solution {
    public boolean wordBreak(String s, List<String> wordDict) {
        int length = s.length();
        boolean[] word = new boolean[length+1];
        word[0] = true;//代表字符串之前的空字符串，永远可以被拆分
        for(int i=1;i<=length;i++){
            for(int j=0;j<i;j++){
                   //s.substring(j,i),截取的是s[j]...s[i-1],不包括s[i]
                   //word数组的坐标和substring的坐标不一样
                   //word[i]表示s[i-1]及之前的子字符串能否被拆分成单词
                if( word[j] && wordDict.contains(s.substring(j,i))){
                    //s[j-1]及之前的字符串能被拆分成单词，且s[j]...s[i-1]也是单词                 
                    word[i] = true;
                    //标记s[i-1]及之前的子字符串能被拆分成单词
                    break;
                }
            }
        }
        //s[length-1]及之前的字符串能否全部被拆分成单词
        return  word[length];
    }
}

失败代码，利用递归，超出时间限制：

class Solution {
    boolean isMatch = false;
    public boolean wordBreak(String s, List<String> wordDict) {
        isMatch=false;
        checkMatch(s,wordDict);
        return  isMatch;
    }
    
    void checkMatch(String s, List<String> wordDict){
        if(s.equals(""))
            isMatch=true;
        for(int i=0;i<wordDict.size();i++){
            String word =wordDict.get(i);
            if(s.indexOf(word) == 0)
            {
                String child =s.substring(word.length());
                if(child.equals("")) {
                    isMatch = true;
                    return;
                }
                checkMatch(child,wordDict);

            }
        }
    }
}

失败用例：

"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab"
["a","aa","aaa","aaaa","aaaaa","aaaaaa","aaaaaaa","aaaaaaaa","aaaaaaaaa","aaaaaaaaaa"]