StreamChecker(words): Constructor, init the data structure with the given words.
query(letter): returns true if and only if for some k >= 1, the last k characters queried (in order from oldest to newest, including this letter just queried) spell one of the words in the given list.
例子
StreamChecker streamChecker = new StreamChecker(["cd","f","kl"]); // init the dictionary. streamChecker.query('a'); // return false streamChecker.query('b'); // return false streamChecker.query('c'); // return false streamChecker.query('d'); // return true, because 'cd' is in the wordlist streamChecker.query('e'); // return false streamChecker.query('f'); // return true, because 'f' is in the wordlist streamChecker.query('g'); // return false streamChecker.query('h'); // return false streamChecker.query('i'); // return false streamChecker.query('j'); // return false streamChecker.query('k'); // return false streamChecker.query('l'); // return true, because 'kl' is in the wordlist
Note
1 <= words.length <= 2000
1 <= words[i].length <= 2000
Words will only consist of lowercase English letters.
Queries will only consist of lowercase English letters.
voidinsertWord(conststd::string& word){ TrieNode* current = m_head; for (int i = 0; i < word.length(); i++) { int index = word[i] - 'a'; if (!current->next_level[index]) { current->next_level[index] = new TrieNode(); } current = current->next_level[index]; } current->is_word = true; }
voidinsertWord(conststd::string& word){ TrieNode* current = m_head; for (int i = word.length() - 1; i >= 0; i--) { int index = word[i] - 'a'; if (!current->next_level[index]) { current->next_level[index] = new TrieNode(); } current = current->next_level[index]; } current->is_word = true; }