标签：Search 1268 String Trie Suggestions next PriorityQueue products new

I user Trie to store the products. For every Trie node, it has the links to the next character and a PriorityQueue. 

The PriorityQueue is used to store all products has has a prefix till the node's character.

After the Trie is build up, the searching will be very easy.

The Time Complexity:

Insert: O(n), n is the total number of characters in products.

Search: O(m*klog(k)), m is the length of SearchWord, k is the number of String in PriorityQueue.

Space Complexity: O(26*n) = O(n), n is the total number of characters in products.

class Solution {
    class Trie{
        Trie[] next = new Trie[26];
        PriorityQueue<String> products = new PriorityQueue<>();
        
        public void insert(String s){
            Trie t = this;
            for(char c: s.toCharArray()){
                if(t.next[c-'a']==null)
                    t.next[c-'a']= new Trie();
                t = t.next[c-'a'];
                t.products.offer(s);
            }
        }
        
        public List<List<String>> search(String s){
            List<List<String>> res = new ArrayList<>();
            Trie t = this;
            for(char c: s.toCharArray()){
                if(t!=null){
                    t = t.next[c-'a'];
                    if(t!=null){
                        int size = Math.min(3, t.products.size());
                        List<String> list = new ArrayList<>();
                        for(int i=0;i<size;i++){
                            list.add(t.products.poll());
                        }
                        res.add(list);
                    }else{
                        res.add(new ArrayList<>());
                    }
                }else
                    res.add(new ArrayList<>());
            }
            return res;
        }
    }
    public List<List<String>> suggestedProducts(String[] products, String searchWord) {
        Trie t = new Trie();
        for(String s: products){
            t.insert(s);
        }
        return t.search(searchWord);
    }
}

标签：Search,1268,String,Trie,Suggestions,next,PriorityQueue,products,new
来源： https://www.cnblogs.com/feiflytech/p/16024349.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。