力扣140 单词拆分2

前缀树加回溯

class Solution {
    Node root = new Node(new Node[26]);
    List<String> res;
    List<Integer> dgU;
    String s;
    public List<String> wordBreak(String s, List<String> wordDict) {
        this.s = s;
        for(String ss:wordDict){
            Node p = root;
            for(int i=0;i<ss.length();i++) {
                int c = ss.charAt(i)-'a';
                if(p.nexts[c] == null) {
                    p.nexts[c] = new Node(new Node[26]);
                }
                if(i==ss.length()-1) {
                    p.nexts[c].end = true;
                }
                p = p.nexts[c];
            }
        }
        // System.out.println(root);
        res = new ArrayList<String>();
        dgU = new ArrayList<>();
        dgU.add(0);
        dg(0);
        return res;
    }
    public void dg(int i){
        if(i==s.length()){
            StringBuilder sb = new StringBuilder();
            for(int j=1;j<dgU.size();j++){
                sb.append(s.substring(dgU.get(j-1),dgU.get(j)));
                sb.append(" ");
            }
            sb.deleteCharAt(sb.length()-1);
            res.add(sb.toString());
            return;
        }
        List<Integer> list = treeSearch(i);
        for(int j:list){
            dgU.add(j+1);
            dg(j+1);
            dgU.remove(dgU.size()-1);
        }
    }
    public List<Integer> treeSearch(int i){
        if(i>=s.length()){
            return new ArrayList<>();
        }
        List<Integer> list = new ArrayList<>();
        Node p = root;
        int c = s.charAt(i) - 'a';
        while( p.nexts[c]!=null){
            if(p.nexts[c].end){
                list.add(i);
            }
            p = p.nexts[c];
            i++;
            if(i<s.length()){
                c = s.charAt(i) - 'a';
            }
        }
        return list;
    }
}
class Node{
    boolean end;
    Node[] nexts;
    public Node(Node[] nexts){
        this.nexts = nexts;
    }
    public String toString(){
        return "(" + end + ")" + Arrays.toString(nexts);
    }
}