Leetcode - Design Search Autocomplete System

https://leetcode.com/problems/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:

1. The hot degree for a sentence is defined as the number of times a user typed the exactly same sentence before.
2. 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).
3. If less than 3 hot sentences exist, then just return as many as you can.
4. 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<String> 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:

1. The input sentence will always start with a letter and end with '#', and only one blank space will exist between two words.
2. 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.
3. Please use double-quote instead of single-quote when you write test cases even for a character input.
4. 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.

It's definitely a trie problem. The most difficult thing is trying to figure out what is the # and what is the operation. Of course this  solution can be refined to use heap to track the result. But I'm a bit tired of composing heap struct in Go.

type AutocompleteSystem struct {
    Root *Node
    Curr *Node
    Str []byte
}

type Node struct {
    Children map[byte]*Node
    Count int
    Val string
}

func Constructor(sentences []string, times []int) AutocompleteSystem {
    root := &Node{
        Children: map[byte]*Node{},
    }
    for i, s := range sentences {
        insert(root, s, times[i])
    }
    return AutocompleteSystem{Root: root, Curr: root}
}

type word struct {
    str string
    count int
}

func dfs(node *Node, result *[]*word) {
    if node == nil {
        return
    }
    if node.Val != "" {
        *result = append(*result, &word{str: node.Val, count: node.Count})
    }
    for _, n := range node.Children {
        dfs(n, result)
    }
}

func insert(node *Node, s string, times int) {
    //fmt.Println("input: ", s)
    for i := 0; i < len(s); i++ {
        if node.Children[s[i]] == nil {
            node.Children[s[i]] = &Node{
                Children: map[byte]*Node{},
            }
        }
        node = node.Children[s[i]]
    }
    node.Val = s
    node.Count += times
}

func (this *AutocompleteSystem) Input(c byte) []string {
    node := this.Curr
    collections := []*word{}
    result := []string{}
    
    if c == '#' {
        insert(this.Root, string(this.Str), 1)
        this.Curr = this.Root
        this.Str = []byte{}
        return result
    }
    this.Str = append(this.Str, c)
    if c != '#' && node != nil {
        dfs(node.Children[c], &collections)
        
        if len(collections) > 0 {
            sort.Slice(collections, func(i, j int) bool {
                if collections[i].count > collections[j].count {
                    return true
                } else if collections[i].count < collections[j].count {
                    return false
                }
                return collections[i].str < collections[j].str
            })
            i := 0
            for i < len(collections) && i < 3 {
                result = append(result, collections[i].str)
                i++
            }
        }
        this.Curr = this.Curr.Children[c]
        return result
        //insert(this.Root, string(this.Str), 1)
    }
    
    return result
}

/**
 * Your AutocompleteSystem object will be instantiated and called as such:
 * obj := Constructor(sentences, times);
 * param_1 := obj.Input(c);
 */

• 相关文章
• 全局相关文章