forked from Dev-XYS/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Trie(Array).cpp
73 lines (66 loc) · 831 Bytes
/
Trie(Array).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
#include <cstdio>
#include <cstring>
#define TRIE_SIZE 100000
using namespace std;
struct node
{
int cnt;
int next[26];
}T[TRIE_SIZE];
int nc = 2;
void insert(char *s)
{
int len = strlen(s), cur = 1;
for (int i = 0; i < len; i++)
{
if (T[cur].next[s[i]] == 0)
{
T[cur].next[s[i]] = nc;
cur = nc;
nc++;
}
else
{
cur = T[cur].next[s[i]];
}
}
T[cur].cnt++;
}
int query(char *s)
{
int len = strlen(s), cur = 1;
for (int i = 0; i < len; i++)
{
if (T[cur].next[s[i]] == 0)
{
return 0;
}
else
{
cur = T[cur].next[s[i]];
}
}
return T[cur].cnt;
}
int main()
{
int o;
char s[100];
while (true)
{
scanf("%d%s", &o, s);
if (o == 1)
{
insert(s);
}
else if (o == 2)
{
printf("%d\n", query(s));
}
else
{
printf("No such command!\n");
}
}
return 0;
}