hiho 第二周

Trie树，第一次写，简单的建树+搜索

它的思路hiho上讲得很清楚，good~

#include<iostream>
#include<string>
using namespace std;
char word[11];
int n,m;
struct trie
{
    int num;
    trie *next[26];
    trie()
    {
        num = 0;
        for(int i = 0; i < 26; i++)
            next[i] = 0;
    }
}t;
trie *p;
void setup(char w[])
{
    p = &t;
    for(int i = 0; word[i]; i++)
    {
        int pos = word[i] - 'a';
        if(p->next[pos] == 0)
        {
            trie *q;
            q = new trie();
            p->next[pos] = q;
        }
        p = p->next[pos];
        p->num++;
    }
}

int findnum(char word[])
{
    p = &t;
    for(int i = 0; word[i];i++)
    {
        int pos = word[i] - 'a';
        if(p->next[pos] == 0) return 0;
        p = p->next[pos];
    }
    return p->num;
}

int main()
{
    cin>>n;
    while(n--)
    {
        cin>>word;
        setup(word);
    }
    cin>>m;
    while(m--)
    {
        cin>>word;
        cout<<findnum(word)<<endl;
    }
    return 0;
}