[Leetcode] 642. Design Search Autocomplete System 解题报告

本博客介绍如何设计一个搜索自动补全系统,根据用户输入的字符动态提供最热门的前3个历史句子建议。系统基于字典树数据结构,记录每个句子的热度并按热度和ASCII顺序排序。给出了构造函数和输入处理函数的实现思路及代码。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目

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 dataSentences 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.

思路

一道字典树的应用题目。我们在定义字典树节点的时候,给里面包含一个count项,如果count == 0则表示该节点不是尾节点;否则就表示该对应的字符串出现的次数(一定是大于0的)。在构造函数中,我们将每个sentence都加入到字典树中。在input函数中,我们每得到一个字符,就将截止目前所构成的前缀加入到字典树中,并且用DFS方法获得所有包含该前缀的字符串。最后返回热度最高的三个字符串即可。

代码

class AutocompleteSystem {
public:
    AutocompleteSystem(vector<string> sentences, vector<int> times) {
        root = new Trie();
        node = root;
        search_input.clear();
        for (int i = 0; i < sentences.size(); ++i) {
            addNode(sentences[i], times[i]);
        }
    }
    
    vector<string> input(char c) {
        if (c == '#') {
            addNode(search_input, 1);
            search_input = "";
            node = root;
            return {};
        }
        else {
            search_input += c;
            int index = c == ' ' ? 0 : 1 + c - 'a';
            if (node->children[index] == NULL) {
                node->children[index] = new Trie();
            }
            node = node->children[index];
            vector<pair<int, string>> search_results;
            DFS(node, search_input, search_results);
            sort(search_results.begin(), search_results.end());
            vector<string> ret;
            for (int i = 0; i < min(3, (int)search_results.size()); ++i) {
                ret.push_back(search_results[i].second);
            }
            return ret;
        }
    }
private:
    struct Trie {
        int count;  // 0 means not the end point, otherwise mean the count
        vector<Trie*> children;
        Trie() {
            count = 0;
            children = vector<Trie*>(27, NULL);
        }
    };
    void addNode(string &s, int time) {
        Trie *node = root;
        for (int i = 0; i < s.length(); ++i) {
            int index = s[i] == ' ' ? 0 : s[i] - 'a' + 1;
            if (node->children[index] == NULL) {
                node->children[index] = new Trie();
            }
            node = node->children[index];
        }
        node->count += time;
    }
    void DFS(Trie *node, string prefix, vector<pair<int, string>> &results) {
        if (node == NULL) {
            return;
        }
        if (node->count > 0) {
            results.push_back(make_pair(-node->count, prefix)); // make larger values in front after sort
        }
        for (int i = 0; i < 27; ++i) {
            char c = i == 0 ? ' ' : 'a' + i - 1;
            DFS(node->children[i], prefix + c, results);
        }
    }
    Trie *root, *node;
    string search_input;
};

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

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值