My_CP_Library/Trie.cpp at main · ngducmanh21/My_CP_Library · GitHub

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

structTrieNode {
 TrieNode* child[26];
int cnt;

TrieNode() {
for (int i = 0; i < 26; i++)
 child[i] = NULL;
 cnt = 0;
 }
};

TrieNode* root = new TrieNode();

voidadd (const string& s) {
 TrieNode* u = root;
for (char ch : s) {
int id = ch - 'a';
if (u -> child[id] == NULL) {
 u -> child[id] = newTrieNode();
 }
 u = u -> child[id];
 }
 u -> cnt++;
}
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

structTrieNode {
 TrieNode* child[26];
int cnt;

TrieNode() {
for (int i = 0; i < 26; i++)
 child[i] = NULL;
 cnt = 0;
 }
};

TrieNode* root = new TrieNode();

voidadd (const string& s) {
 TrieNode* u = root;
for (char ch : s) {
int id = ch - 'a';
if (u -> child[id] == NULL) {
 u -> child[id] = newTrieNode();
 }
 u = u -> child[id];
 }
 u -> cnt++;
}
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

structTrieNode {
 TrieNode* child[26];
int cnt;

TrieNode() {
for (int i = 0; i < 26; i++)
 child[i] = NULL;
 cnt = 0;
 }
};

TrieNode* root = new TrieNode();

voidadd (const string& s) {
 TrieNode* u = root;
for (char ch : s) {
int id = ch - 'a';
if (u -> child[id] == NULL) {
 u -> child[id] = newTrieNode();
 }
 u = u -> child[id];
 }
 u -> cnt++;
}
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

structTrieNode {
 TrieNode* child[26];
int cnt;

TrieNode() {
for (int i = 0; i < 26; i++)
 child[i] = NULL;
 cnt = 0;
 }
};

TrieNode* root = new TrieNode();

voidadd (const string& s) {
 TrieNode* u = root;
for (char ch : s) {
int id = ch - 'a';
if (u -> child[id] == NULL) {
 u -> child[id] = newTrieNode();
 }
 u = u -> child[id];
 }
 u -> cnt++;
}
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

structTrieNode {
 TrieNode* child[26];
int cnt;

TrieNode() {
for (int i = 0; i < 26; i++)
 child[i] = NULL;
 cnt = 0;
 }
};

TrieNode* root = new TrieNode();

voidadd (const string& s) {
 TrieNode* u = root;
for (char ch : s) {
int id = ch - 'a';
if (u -> child[id] == NULL) {
 u -> child[id] = newTrieNode();
 }
 u = u -> child[id];
 }
 u -> cnt++;
}
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

structTrieNode {
 TrieNode* child[26];
int cnt;

TrieNode() {
for (int i = 0; i < 26; i++)
 child[i] = NULL;
 cnt = 0;
 }
};

TrieNode* root = new TrieNode();

voidadd (const string& s) {
 TrieNode* u = root;
for (char ch : s) {
int id = ch - 'a';
if (u -> child[id] == NULL) {
 u -> child[id] = newTrieNode();
 }
 u = u -> child[id];
 }
 u -> cnt++;
}
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

structTrieNode {
 TrieNode* child[26];
int cnt;

TrieNode() {
for (int i = 0; i < 26; i++)
 child[i] = NULL;
 cnt = 0;
 }
};

TrieNode* root = new TrieNode();

voidadd (const string& s) {
 TrieNode* u = root;
for (char ch : s) {
int id = ch - 'a';
if (u -> child[id] == NULL) {
 u -> child[id] = newTrieNode();
 }
 u = u -> child[id];
 }
 u -> cnt++;
}
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

structTrieNode {
 TrieNode* child[26];
int cnt;

TrieNode() {
for (int i = 0; i < 26; i++)
 child[i] = NULL;
 cnt = 0;
 }
};

TrieNode* root = new TrieNode();

voidadd (const string& s) {
 TrieNode* u = root;
for (char ch : s) {
int id = ch - 'a';
if (u -> child[id] == NULL) {
 u -> child[id] = newTrieNode();
 }
 u = u -> child[id];
 }
 u -> cnt++;
}