Leetcode Problem 642. Design Search Autocomplete System
Leetcode Solutions
Trie with Priority Queue
- Define a TrieNode class with a children map and a sentences map.
- Implement the addToTrie method to insert sentences into the trie.
- Initialize the AutocompleteSystem with a root TrieNode.
- For each input character, traverse the trie and update the current TrieNode.
- If the character is '#', add the current sentence to the trie and reset.
- If the character is not '#', use a priority queue to find the top 3 sentences.
- Return the top 3 sentences or as many as available.
Brute Force Search with Sorting
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...