hrbust2058

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qiaojun1234567/article/details/21411831

字典树的模板题

连接：背单词

AC代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
struct Tire
{
    int nCount;
    Tire*next[26];
    Tire()
    {
        memset(next,0,sizeof(next));
        nCount=0;
    }
};
Tire *root;
void del(Tire*head)
{
    for(int i=0;i<26;i++)
        if(head->next[i]!=NULL)
        del(head->next[i]);
    delete head;
}
void Insert(char msg[])
{
    int i=0;
    Tire*cur=root;
    while(msg[i])
    {
        int k=msg[i]-'a';
        if(cur->next[k]==NULL)
            cur->next[k]=new Tire();
        cur=cur->next[k];
        cur->nCount++;
        i++;
    }
}
int FindTire(char msg[])
{
    int i=0;
    Tire *cur=root;
    while(msg[i])
    {
        int k=msg[i]-'a';
        if(cur->next[k]!=NULL)
            cur=cur->next[k];
        else
            return 0;
            i++;
    }
    return cur->nCount;
}
int main()
{
    root=new Tire();
    char tmp[18];
    while(true)
    {
        scanf("%s",tmp);
        if(strcmp(tmp,"END")==0)
            break;
        Insert(tmp);
    }
    while(scanf("%s",tmp)!=EOF)
    {
        printf("%d\n",FindTire(tmp));
    }
    del(root);
    return 0;
}