1268. Search Suggestions System

Given an array of strings products and a string searchWord. We want to design a system that suggests at most three product names from products after each character of searchWord is typed. Suggested products should have common prefix with the searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products.

Return list of lists of the suggested products after each character of searchWord is typed.

Example 1:

Input: products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse"
Output: [
["mobile","moneypot","monitor"],
["mobile","moneypot","monitor"],
["mouse","mousepad"],
["mouse","mousepad"],
["mouse","mousepad"]
]
Explanation: products sorted lexicographically = ["mobile","moneypot","monitor","mouse","mousepad"]
After typing m and mo all products match and we show user ["mobile","moneypot","monitor"]
After typing mou, mous and mouse the system suggests ["mouse","mousepad"]

Example 2:

Input: products = ["havana"], searchWord = "havana"
Output: [["havana"],["havana"],["havana"],["havana"],["havana"],["havana"]]

Example 3:

Input: products = ["bags","baggage","banner","box","cloths"], searchWord = "bags"
Output: [["baggage","bags","banner"],["baggage","bags","banner"],["baggage","bags"],["bags"]]

Example 4:

Input: products = ["havana"], searchWord = "tatiana"
Output: [[],[],[],[],[],[],[]]

Constraints:

• 1 <= products.length <= 1000

• There are no repeated elements in products.

• 1 <= Σ products[i].length <= 2 * 10^4

• All characters of products[i] are lower-case English letters.

• 1 <= searchWord.length <= 1000

• All characters of searchWord are lower-case English letters.

// Sort + Binary Search for the prefix
vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) { 
    sort(products.begin(), products.end());
    vector<vector<string> > res;
    res.reserve(searchWord.length());
    vector<string> tmp;
    tmp.reserve(3);
    string cur;
    auto it = products.begin();
    for (const char& c : searchWord) {
        tmp.clear();
        cur += c;
        it = lower_bound(it, products.end(), cur);
        for (int i = 0; i < 3 && it + i != products.end(); ++i) {
            const string& s = *(it + i);
            if (s.find(cur) == string::npos) break;
            tmp.push_back(s);
        }
        res.push_back(tmp);
    }
    return res;
}

// Trie + Array
class TrieNode {
public:
    TrieNode() : next(26, nullptr) {}
    ~TrieNode() {
        for (auto& p : next) {
            if (p) delete p;
        }
    }
    vector<TrieNode*> next;
    vector<string> suggestion;
};
vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
    // Build Trie
    TrieNode* root = new TrieNode(), *cur = nullptr;
    for (const string& word : products) {
        TrieNode* cur = root;
        for (const char& c : word) {
            if (!cur->next[c - 'a']) cur->next[c - 'a'] = new TrieNode();
            cur = cur->next[c - 'a'];
            cur->suggestion.push_back(word);
        }
    }
    // Search Prefix
    vector<vector<string> > res(searchWord.length());
    cur = root;
    for (int i = 0; i < searchWord.length() && cur->next[searchWord[i] - 'a']; ++i) {
        cur = cur->next[searchWord[i] - 'a'];
        sort(cur->suggestion.begin(), cur->suggestion.end());
        cur->suggestion.resize(min(3, (int)cur->suggestion.size() ) );
        res[i] = cur->suggestion;
    }
    return res;
}

// Trie + Heap
class TrieNode {
public:
    TrieNode() : next(26, nullptr) {}
    ~TrieNode() {
        for (auto& p : next) {
            if (p) delete p;
        }
    }
    vector<TrieNode*> next;
    priority_queue<string> suggestion;
};
vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
    // Build Trie
    TrieNode* root = new TrieNode(), *cur = nullptr;
    for (const string& word : products) {
        TrieNode* cur = root;
        for (const char& c : word) {
            if (!cur->next[c - 'a']) cur->next[c - 'a'] = new TrieNode();
            cur = cur->next[c - 'a'];
            cur->suggestion.push(word);
            if (cur->suggestion.size() > 3) cur->suggestion.pop();
        }
    }
    // Search Prefix
    vector<vector<string> > res(searchWord.length());
    cur = root;
    for (int i = 0; i < searchWord.length() && cur->next[searchWord[i] - 'a']; ++i) {
        cur = cur->next[searchWord[i] - 'a'];
        vector<string> tmp(cur->suggestion.size());
        for (int j = cur->suggestion.size() - 1; j >= 0; --j) {
            tmp[j] = cur->suggestion.top();
            cur->suggestion.pop();
        }
        res[i] = tmp;
    }
    return res;
}