-
Notifications
You must be signed in to change notification settings - Fork 3
/
208.cpp
57 lines (52 loc) · 1.3 KB
/
208.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
class TrieNode {
public:
vector<TrieNode*> children;
bool isEnd = false;
TrieNode() {
children.resize(26, nullptr);
}
};
class Trie {
public:
TrieNode* root;
Trie() {
root = new TrieNode();
}
void insert(string word) {
TrieNode* current = root;
for (auto c : word) {
if (!current->children[c - 'a']) {
current->children[c - 'a'] = new TrieNode();
}
current = current->children[c - 'a'];
}
current->isEnd = true;
}
bool search(string word) {
TrieNode* current = root;
for (auto c : word) {
if (!current->children[c - 'a']) {
return false;
}
current = current->children[c - 'a'];
}
return current->isEnd;
}
bool startsWith(string prefix) {
TrieNode* current = root;
for (auto c : prefix) {
if (!current->children[c - 'a']) {
return false;
}
current = current->children[c - 'a'];
}
return true;
}
};
/**
* 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);
*/