-
Notifications
You must be signed in to change notification settings - Fork 50
/
Copy path1211 - Economic Phonebook.cpp
71 lines (52 loc) · 1.02 KB
/
1211 - Economic Phonebook.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
#include <iostream>
#include <string>
using namespace std;
struct trie {
bool is_number;
trie* next[10];
trie() {
is_number = false;
for(int i = 0; i < 10; i++)
next[i] = NULL;
}
};
trie* root;
int res;
void insert(string s) {
trie* cursor = root;
for(int i = 0, len = s.length(); i < len; i++) {
int number = s[i] - '0';
if(cursor->next[number] == NULL) {
cursor->next[number] = new trie;
cursor->next[number]->is_number = false;
for(int j = 0; j < 10; j++)
cursor->next[number]->next[j] = NULL;
} else {
res++;
}
cursor = cursor->next[number];
}
cursor->is_number = true;
}
void freeTrie(trie* cursor) {
if(cursor == NULL)
return;
for(int i = 0; i < 10; i++)
freeTrie(cursor->next[i]);
delete[] cursor;
}
int main() {
int n;
while(cin >> n) {
res = 0;
root = new trie;
for(int i = 0; i < n; i++) {
string s;
cin >> s;
insert(s);
}
cout << res << endl;
freeTrie(root);
}
return 0;
}