LeetCode 140. Word Break II(java)

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences.

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 = "catsanddog"
wordDict = ["cat", "cats", "and", "sand", "dog"]
Output:
[
  "cats and dog",
  "cat sand dog"
]

Example 2:

Input:
s = "pineapplepenapple"
wordDict = ["apple", "pen", "applepen", "pine", "pineapple"]
Output:
[
  "pine apple pen apple",
  "pineapple pen apple",
  "pine applepen apple"
]
Explanation: Note that you are allowed to reuse a dictionary word.

Example 3:

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

Recursion + Memory Caches

class Solution {
    //recursion, 从0开始到n-1遍历
    public List<String> wordBreak(String s, List<String> wordDict) {
        HashSet<String> set = new HashSet<>(wordDict);
        HashMap<Integer, List<String>> map = new HashMap<>();
        return helper(s, 0, set, map);
    }
    public List<String> helper(String s, int i, HashSet<String> set, HashMap<Integer, List<String>> map) {
	    if (map.containsKey(i)) return map.get(i);

	    List<String> result = new ArrayList<>();
	    for (int j = i+1; j <= s.length(); j++) {
                if (set.contains(s.substring(i, j))) {
                List<String> pre = helper(s, j, set, map);
                if (j == s.length()) {
                    result.add(s.substring(i,j));
                } else {
                    for (int ii = 0; ii < pre.size(); ii++) {
                        String str = pre.get(ii);
                        str = s.substring(i, j) + " " + str;
                        result.add(str);
                    }
                }
            }
        }
        map.put(i, result);
        return result;
    }
}