CPMagical CP Library

Problem solution · C++

Design Search Autocomplete System

Design Search Autocomplete System: a C++ solution using sorting and greedy selection. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Sorting and greedy selection
Source
Kamyu LeetCode Solutions
Length
95 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sorting and greedy selection

For Design Search Autocomplete System, the implementation first exposes a useful order, then scans that order while making locally justified choices.

  1. Choose the key that reveals the greedy or grouping structure.
  2. Sort the relevant records by that key.
  3. Scan in order, maintaining the invariant that makes each local choice safe.

Code notes

  • 95 lines of C++ from the credited upstream file design-search-autocomplete-system.cpp.
  • The implementation visibly relies on sequence storage, hash lookup.
  • 4 loop blocks detected.

Complexity

Sorting is typically the dominant term unless the subsequent scan uses a more expensive nested operation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeDesign Search Autocomplete System · C++C++
Use this to learn the idea, then write your own version.
// Time:  O(p^2), p is the length of the prefix// Space: O(p * t + s), t is the number of nodes of trie//                    , s is the size of the sentences class AutocompleteSystem {public:    AutocompleteSystem(vector<string> sentences, vector<int> times) : cur_node_(&trie_) {        for (int i = 0; i < size(sentences); ++i) {            sentence_to_count_[sentences[i]] = times[i];            trie_.insert(sentences[i], sentence_to_count_[sentences[i]]);        }    }        vector<string> input(char c) {        vector<string> result;        if (c == '#') {            ++sentence_to_count_[search_];            trie_.insert(search_, sentence_to_count_[search_]);            cur_node_ = &trie_;            search_.clear();        } else {            search_.push_back(c);            if (cur_node_) {                if (!cur_node_->leaves_.count(c)) {                    cur_node_ = nullptr;                    return {};                }                cur_node_ = cur_node_->leaves_[c];                for (const auto& p : cur_node_->infos_) {                    result.emplace_back(p.second);                }            }           }        return result;    } private:    class TrieNode {    public:        static const int TOP_COUNT = 3;         ~TrieNode() {            for (auto& kv : leaves_) {                if (kv.second) {                    delete kv.second;                }            }        }         // Time:  O(s)        void insert(const string& s, int times) {            auto* cur = this;            cur->add_info(s, times);            for (const auto& c : s) {                if (!cur->leaves_.count(c)) {                    cur->leaves_[c] = new TrieNode;                }                cur = cur->leaves_[c];                cur->add_info(s, times);            }        }                // Time:  O(1)        void add_info(const string& s, int times) {            auto it = find_if(begin(infos_), end(infos_),                              [&s, &times](const pair<int, string>& p) {                                  return p.second == s;                              } );	    if (it != end(infos_)) {                it->first = -times;            } else {                infos_.emplace_back(-times, s);            }            sort(begin(infos_), end(infos_));            if (size(infos_) > TOP_COUNT) {                infos_.pop_back();            }        }                vector<pair<int, string>> infos_;        unordered_map<char, TrieNode *> leaves_;    };     TrieNode trie_;    TrieNode *cur_node_;    string search_;    unordered_map<string, int> sentence_to_count_;}; /** * Your AutocompleteSystem object will be instantiated and called as such: * AutocompleteSystem obj = new AutocompleteSystem(sentences, times); * vector<string> param_1 = obj.input(c); */

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗