应用场景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
55class Trie {
public:
/** Initialize your data structure here. */
Trie* next[26] = {NULL};
bool isLeaf;
Trie() {
isLeaf = false;
}
/** Inserts a word into the trie. */
void insert(string word) {
Trie* node = this;
for (char c : word) {
int i = int(c - 'a');
if (node->next[i] == NULL) {
node->next[i] = new Trie();
}
node = node->next[i];
}
node->isLeaf = true;
return;
}
/** Returns if the word is in the trie. */
bool search(string word) {
Trie* node = this;
for (char c : word) {
int i = int(c - 'a');
if (node->next[i]) {
node = node->next[i];
} else {
return 0;
}
}
if (node->isLeaf) {
return 1;
}
return 0;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
bool startsWith(string prefix) {
Trie* node = this;
for (char c : prefix) {
int i = int(c - 'a');
if (node->next[i]) {
node = node->next[i];
} else {
return 0;
}
}
return 1;
}
};