LeetCode-Word Break（JAVA）

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

思路：遍历字符串以0-i个字符开头的字符串如果在word中存在，则递归查询i+1个字符之后的字符串

class Solution {
    Map<String, Boolean> maps = new HashMap();
    public boolean wordBreak(String s, List<String> wordDict) {
       Set<String> words = new HashSet();
        for(int i = 0; i < wordDict.size(); i++) {
            words.add(wordDict.get(i));
        }
        
        return wordBreak1(s, words); 
    }
    
    public boolean wordBreak1(String s, Set<String> words) {
        if(maps.containsKey(s)) {
            return maps.get(s);
        }
        if(words.contains(s)) {
            maps.put(s, true);
            return true;
        }
        
        for(int i = 1; i < s.length(); i++) {
            String tmp = s.substring(0, i);
            if(!words.contains(tmp)) {
                continue;
            }
            if(wordBreak1(s.substring(i), words)) {
                maps.put(s, true);
                return true;
            }
        }
        maps.put(s, false);
        return false;
        
    }
}