A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.
Implement the Trie class:
Trie()
Initializes the trie object.void insert(String word)
Inserts the stringword
into the trie.boolean search(String word)
Returnstrue
if the stringword
is in the trie (i.e., was inserted before), andfalse
otherwise.boolean startsWith(String prefix)
Returnstrue
if there is a previously inserted stringword
that has the prefixprefix
, andfalse
otherwise.
Example 1:
Input ["Trie", "insert", "search", "search", "startsWith", "insert", "search"] [[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]] Output [null, null, true, false, true, null, true] Explanation Trie trie = new Trie(); trie.insert("apple"); trie.search("apple"); // return True trie.search("app"); // return False trie.startsWith("app"); // return True trie.insert("app"); trie.search("app"); // return True
Constraints:
1 <= word.length, prefix.length <= 2000
word
andprefix
consist only of lowercase English letters.- At most
3 * 10^4
calls in total will be made toinsert
,search
, andstartsWith
.
【C++】
class TrieNode {
public:
TrieNode* childNode[26];
bool isVal;
TrieNode(): isVal(false) {
for (int i = 0; i < 26; ++i) {
childNode[i] = nullptr;
}
}
};
class Trie {
TrieNode* root;
public:
Trie(): root(new TrieNode()) {}
void insert(string word) {
TrieNode* temp = root;
for (int i = 0; i < word.size(); ++i) {
if (!temp->childNode[word[i] - 'a']) {
temp->childNode[word[i] - 'a'] = new TrieNode();
}
temp = temp->childNode[word[i] - 'a'];
}
temp->isVal = true;
}
bool search(string word) {
TrieNode* temp = root;
for (int i = 0; i < word.size(); ++i) {
if (!temp) {break;}
temp = temp->childNode[word[i] - 'a'];
}
return temp ? temp->isVal: false;
}
bool startsWith(string prefix) {
TrieNode* temp = root;
for (int i = 0; i < prefix.size(); ++i) {
if (!temp) { break;}
temp = temp->childNode[prefix[i] - 'a'];
}
return temp;
}
};
/**
* Your Trie object will be instantiated and called as such:
* Trie* obj = new Trie();
* obj->insert(word);
* bool param_2 = obj->search(word);
* bool param_3 = obj->startsWith(prefix);
*/
【Java】
class Trie {
private TrieNode root;
private class TrieNode {
public TrieNode[] mChildNode = new TrieNode[26];
public boolean mIsVal = false;
public TrieNode() {
for (int i = 0; i < 26; ++i) {
mChildNode[i] = null;
}
}
}
public Trie() {
root = new TrieNode();
}
public void insert(String word) {
TrieNode temp = root;
for (int i = 0; i < word.length(); ++i) {
if (temp.mChildNode[word.charAt(i) - 'a'] == null) {
temp.mChildNode[word.charAt(i) - 'a'] = new TrieNode();
}
temp = temp.mChildNode[word.charAt(i) - 'a'];
}
temp.mIsVal = true;
}
public boolean search(String word) {
TrieNode temp = root;
for (int i = 0; i < word.length(); ++i) {
if (temp == null) {break;}
temp = temp.mChildNode[word.charAt(i) - 'a'];
}
return temp != null ? temp.mIsVal : false;
}
public boolean startsWith(String prefix) {
TrieNode temp = root;
for (int i = 0; i < prefix.length(); ++i) {
if (temp == null) {break;}
temp = temp.mChildNode[prefix.charAt(i) - 'a'];
}
return temp != null;
}
}
/**
* Your Trie object will be instantiated and called as such:
* Trie obj = new Trie();
* obj.insert(word);
* boolean param_2 = obj.search(word);
* boolean param_3 = obj.startsWith(prefix);
*/