-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy pathTrie_iterative.cpp
80 lines (60 loc) · 1.34 KB
/
Trie_iterative.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
75
76
77
78
79
80
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
//To determine that the string is prefix of how many string
struct t{
t* character[26];
int count; // how many strings have passed by me
t()
{
for(int i=0;i<26;i++)
{
character[i]=NULL;
count=0;
}
}
};
int main() {
ios_base::sync_with_stdio(false);
int n,q,i;
cin>>n>>q;
t* root = new t();
t* temp = new t();
string k;
while(n--)
{
temp=root;
cin>>k;
for(i=0;i<k.length();i++)
{
if(temp->character[k[i]-'a']==NULL )
temp->character[k[i]-'a'] = new t();
temp=temp->character[k[i]-'a'];
temp->count++;
}
}
int c;
while(q--)
{
temp=root;
cin>>k;
for(i=0;i<k.length();i++)
{
if(temp->character[k[i]-'a']!=NULL)
{
temp=temp->character[k[i]-'a'];
}
else
break;
}
if(i==k.length())
{
c=temp->count;
}
cout<<c<<"\n";
}
return 0;
}