HihoCoder——Trie树

#include <iostream>
#include <string.h>
#include <stdio.h>

using namespace std;

string str;

struct TrieNode
{
TrieNode *child[26];
//
int num;
TrieNode()
{
num = 0;
memset(child, NULL, sizeof(child));
}
};

TrieNode *root;
int temp;

void Build(string s)
{
TrieNode *p = root;
for(int i = 0; i < s.length(); i++)
{
temp = s[i]-'a';
//      cout << temp << endl;
if(p->child[temp] == NULL)
{
p->child[temp] = new TrieNode;
}
p = p->child[temp];
p->num ++;
}
}

int check(string s)
{
TrieNode *p = root;
for(int i = 0; i < s.length(); i++)
{
temp = s[i]-'a';
if(p->child[temp] == NULL)
return 0;
p = p->child[temp];
}
return p->num;
}

int main()
{
int n, m;
scanf("%d", &n);
root = new TrieNode;
while(n--)
{
cin >> str;
Build(str);
}

scanf("%d", &m);
while(m--)
{
cin >> str;
cout << check(str) << endl;
}

return 0;
}