Search Suggestions System

Given an array of strings products and a string searchWord. We want to design a system that suggests at most three product names from products after each character of searchWord is typed. Suggested products should have common prefix with the searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products.

Return list of lists of the suggested products after each character of searchWord is typed. 

Example 1:

Input: products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse"
Output: [
["mobile","moneypot","monitor"],
["mobile","moneypot","monitor"],
["mouse","mousepad"],
["mouse","mousepad"],
["mouse","mousepad"]
]
Explanation: products sorted lexicographically = ["mobile","moneypot","monitor","mouse","mousepad"]
After typing m and mo all products match and we show user ["mobile","moneypot","monitor"]
After typing mou, mous and mouse the system suggests ["mouse","mousepad"]

思路:用trie，O(n*len(word)); 注意如果不match了，后面全部是add 空，所以cur == null；

class Solution {
    class TrieNode {
        public TrieNode[] children;
        public boolean isword;
        public List<String> list;
        public TrieNode () {
            this.children = new TrieNode[26];
            this.isword = false;
            this.list = new ArrayList<>();
        }
    }
    
    class Trie {
        public TrieNode root;
        public Trie() {
            this.root = new TrieNode();
        }
        
        public void insertWord(String word) {
            TrieNode cur = root;
            for(int i = 0; i < word.length(); i++) {
                char c = word.charAt(i);
                if(cur.children[c - 'a'] == null) {
                    cur.children[c - 'a'] = new TrieNode();
                }
                cur = cur.children[c - 'a'];
                cur.list.add(word);
            }
        }
    }
    
    public List<List<String>> suggestedProducts(String[] products, String searchWord) {
        List<List<String>> lists = new ArrayList<List<String>>();
        Trie trie = new Trie();
        for(String product: products) {
            trie.insertWord(product);
        }
        
        TrieNode cur = trie.root;
        for(int i = 0; i < searchWord.length(); i++) {
            char c = searchWord.charAt(i);
            List<String> list = new ArrayList<>();
            if(cur != null && cur.children[c - 'a'] != null) {
                cur = cur.children[c - 'a'];
                List<String> temp = cur.list;
                Collections.sort(temp);
                for(int k = 0; k < 3 && k < temp.size(); k++) {
                    list.add(temp.get(k));
                }
                lists.add(list);
            } else {
                cur = null;
                lists.add(list);
            }
        }
        return lists;
    }
}