LeetCode word-break-ii

Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.

Return all such possible sentences.

For example, given
s =“catsanddog”,
dict =[“cat”, “cats”, “and”, “sand”, “dog”].

A solution is[“cats and dog”, “cat sand dog”].

这道题的关键在于我们将字符串依次拆分成两部分来进行求解。
就像题目所给的 catsanddog， 列举前几部如何拆分

s1	s2	map
c	atsanddog
ca	tsanddog
cat	wordBreak2(sanddog)	sanddog
s	anddog
sa	nddog
san	ddog
sand	wordBreak2(dog)	dog
d	og)
do	g)
dog	wordBreak2("")) ）
sandd	og
sanddo	g
sanddog	“”
cats	wordBreak2(anddog)
…	…

为了防止重复计算，我们使用一个map来存放当前s所对应的可能解，并存放一个字符串为“”，其Arraylist存放的是一个“”，所以当上面直接遇到 wordBreak2("")，直接返回map.get("").

import java.util.*;
public class Solution {
    private Map<String, ArrayList<String>> map = new HashMap<>();
    
    public ArrayList<String> wordBreak(String s, Set<String> dict) {
    	// 当s切分到尾部无法切分的时候，递归结束
        map.put("", new ArrayList());
        map.get("").add("");
        return wordBreak2(s, dict);
    }
    
    public ArrayList<String> c(String s, Set<String> dict) {
        if (map.containsKey(s)) {
            return map.get(s);
        }
        ArrayList<String> ans = new ArrayList<>();
        for (int i = 1; i <= s.length(); i++) {
            String s1 = s.substring(0, i);
            String s2 = s.substring(i);
            if (dict.contains(s1)) {
            	// 进行下一个分割
                ArrayList<String> s2_rel = wordBreak(s2, dict);
                for (String str : s2_rel) {
                    if (str.equals("")) {
                        ans.add(s1);
                    } else {
                        ans.add(s1 + " " + str);
                    }
                }
            }
        }
        map.put(s, ans);
        return ans;
    }
}

参考：https://www.jiuzhang.com/solution/word-break-ii/