642. Design Search Autocomplete System

问题描述

Design a search autocomplete system for a search engine. Users may input a sentence (at least one word and end with a special character ‘#’). For each character they type except ‘#’, you need to return the top 3 historical hot sentences that have prefix the same as the part of sentence already typed. Here are the specific rules:

The hot degree for a sentence is defined as the number of times a user typed the exactly same sentence before.
The returned top 3 hot sentences should be sorted by hot degree (The first is the hottest one). If several sentences have the same degree of hot, you need to use ASCII-code order (smaller one appears first).
If less than 3 hot sentences exist, then just return as many as you can.
When the input is a special character, it means the sentence ends, and in this case, you need to return an empty list.
Your job is to implement the following functions:

The constructor function:

AutocompleteSystem(String[] sentences, int[] times): This is the constructor. The input is historical data. Sentences is a string array consists of previously typed sentences. Times is the corresponding times a sentence has been typed. Your system should record these historical data.

Now, the user wants to input a new sentence. The following function will provide the next character the user types:

List input(char c): The input c is the next character typed by the user. The character will only be lower-case letters (‘a’ to ‘z’), blank space (’ ‘) or a special character (’#’). Also, the previously typed sentence should be recorded in your system. The output will be the top 3 historical hot sentences that have prefix the same as the part of sentence already typed.

Example:
Operation: AutocompleteSystem([“i love you”, “island”,“ironman”, “i love leetcode”], [5,3,2,2])
The system have already tracked down the following sentences and their corresponding times:
“i love you” : 5 times
“island” : 3 times
“ironman” : 2 times
“i love leetcode” : 2 times
Now, the user begins another search:

Operation: input(‘i’)
Output: [“i love you”, “island”,“i love leetcode”]
Explanation:
There are four sentences that have prefix “i”. Among them, “ironman” and “i love leetcode” have same hot degree. Since ’ ’ has ASCII code 32 and ‘r’ has ASCII code 114, “i love leetcode” should be in front of “ironman”. Also we only need to output top 3 hot sentences, so “ironman” will be ignored.

Operation: input(’ ')
Output: [“i love you”,“i love leetcode”]
Explanation:
There are only two sentences that have prefix "i ".

Operation: input(‘a’)
Output: []
Explanation:
There are no sentences that have prefix “i a”.

Operation: input(’#’)
Output: []
Explanation:
The user finished the input, the sentence “i a” should be saved as a historical sentence in system. And the following input will be counted as a new search.

Note:
The input sentence will always start with a letter and end with ‘#’, and only one blank space will exist between two words.
The number of complete sentences that to be searched won’t exceed 100. The length of each sentence including those in the historical data won’t exceed 100.
Please use double-quote instead of single-quote when you write test cases even for a character input.
Please remember to RESET your class variables declared in class AutocompleteSystem, as static/class variables are persisted across multiple test cases. Please see here for more details.

题目链接：

思路分析

设计实现一个可以根据搜索次数排名的自动补全系统。使用Trie树来实现。

We design a Trie node class which has a map to contain the next children, a counts map stores the frequency and a boolean is word which works to denote a whole sentence.

In the constructor, we get sentences and corresponding times. We new a root node and an empty prefix. Then using a for loop to add sentence and its times to our trie tree.

In the private method add, Get root first, then for this sentence s, convert it to a char array and store them into trie tree. If trie tree does not have this children, add a new trie node to the map. Move forward and store count.

In input, we want to get the top three sentences with highest times. So we need a priority queue to implement it. If c is ‘#’ it means input is over, we add this input sentence as prefix and count = 1 into trie tree, then return an empty list. Each time call input, we add this char to prefix, then search the trie tree. If trie tree does not have this prefix, return an empyt list.

After that, we are sure this prefix is contained in trie tree. So use a priority queue to get the current node. counts map and add all its entries into pq. New an array list which is res and poll top three from pq.

代码

class AutocompleteSystem {
    class TrieNode{
        Map<Character, TrieNode> children;
        Map<String, Integer> counts;
        boolean isWord;
        public TrieNode(){
            children = new HashMap<>();
            counts = new HashMap<>();
            isWord = false;
        }
    }
    
    TrieNode root;
    String prefix;

    public AutocompleteSystem(String[] sentences, int[] times) {
        root = new TrieNode();
        prefix = "";
        
        for (int i = 0; i < sentences.length; i++){
            add(sentences[i], times[i]);
        }
    }
    
    private void add(String s, int count){
        TrieNode cur = root;
        for (char c : s.toCharArray()){
            TrieNode next = cur.children.get(c);
            if (next == null){
                next = new TrieNode();
                cur.children.put(c, next);
            }
            cur = next;
            cur.counts.put(s, cur.counts.getOrDefault(s, 0) + count);
        }
        cur.isWord = true;
    }
    
    public List<String> input(char c) {
        if (c == '#'){
            add (prefix, 1);
            prefix = "";
            return new ArrayList<String>();
        }
        
        prefix = prefix + c;
        TrieNode cur = root;
        for (char ch : prefix.toCharArray()){
            TrieNode next = cur.children.get(ch);
            if (next == null){
                return new ArrayList<String>();
            }
            cur = next;
        }
        
        PriorityQueue<Map.Entry<String, Integer>> pq = new PriorityQueue<>((a, b) -> (a.getValue() == b.getValue() ? a.getKey().compareTo(b.getKey()) : b.getValue() - a.getValue()));
        for (Map.Entry<String, Integer> entry : cur.counts.entrySet()){
            pq.add(entry);
        }
        
        List<String> res = new ArrayList<>();
        for (int i = 0; i < 3 && !pq.isEmpty(); i++){
            res.add(pq.poll().getKey());
        }
        return res;
    }
}

/**
 * Your AutocompleteSystem object will be instantiated and called as such:
 * AutocompleteSystem obj = new AutocompleteSystem(sentences, times);
 * List<String> param_1 = obj.input(c);
 */

时间复杂度：$O()$
空间复杂度：$O()$
AutocompleteSystem() takes $O(k\ast l)O(k\ast l)$ time. We need to iterate over ll sentences each of average length $k$, to create the trie for the given set of sentencessentences.

input() takes $O(p+q+mlog(m))O(p+q+mlog(m))$ time. Here, pp refers to the length of the sentence formed till now, cur_sencursen. q refers to the number of nodes in the trie considering the sentence formed till now as the root node. Again, we need to sort the listlist of length mm indicating the options available for the hot sentences, which takes $O\big(mlog(m)\big)O(mlog(m)) $time.

---

反思