-
Notifications
You must be signed in to change notification settings - Fork 0
/
Implementation_of_Trie.cpp
74 lines (60 loc) · 1.51 KB
/
Implementation_of_Trie.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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
struct Node {
Node* links[26];
bool flag = false;
bool containKey(char ch){
return (links[ch - 'a'] != NULL);
}
void put(char ch,Node* node){
links[ch - 'a'] = node;
}
Node* get(char ch){
return links[ch - 'a'];
}
void end(){
flag = true;
}
bool isEnd(){
return flag;
}
};
class Trie {
private : Node* root;
public:
/** Initialize your data structure here. */
Trie() {
root = new Node();
}
/** Inserts a word into the trie. */
void insert(string word) {
Node* node = root;
for(int i = 0;i < word.size();i ++){
if(!node->containKey(word[i])){
node->put(word[i],new Node());
}
node = node->get(word[i]);
}
node->end();
}
/** Returns if the word is in the trie. */
bool search(string word) {
Node* node = root;
for(int i = 0;i < word.size();i ++){
if(!node->containKey(word[i])){
return false;
}
node = node->get(word[i]);
}
return node->isEnd();
}
/** Returns if there is any word in the trie that starts with the given prefix. */
bool startsWith(string prefix) {
Node* node = root;
for(int i = 0;i < prefix.size();i ++){
if(!node->containKey(prefix[i])){
return false;
}
node = node->get(prefix[i]);
}
return true;
}
};