《 字典树模板_非递归 》

#include <iostream>
#include <cstdlib>
#include <cstdio>

using namespace std;

struct tree
{
    int count;
    tree *next[26];
};
tree *head;

void Insert(char *ch)
{
    int pp=0;
    tree *p;
    p=head;
    for(;;)
    {
        if(ch[pp]=='') break;
        if(p->next[ch[pp]-'a']!=NULL)
        {
            p=p->next[ch[pp]-'a'];
            p->count++;
        }
        else
        {
            tree *Q=(tree *)malloc(sizeof(tree));
            Q->count=1;
            for(int i=0;i<26;i++)
            {
                Q->next[i]=NULL;
            }
            p->next[ch[pp]-'a']=Q;
            p=Q;
        }
        pp++;
    }
}

int find(char *ch)
{
    tree *p=head;
    int pp=0;
    for(;;)
    {
        if(ch[pp]=='') return p->count;
        if(p->next[ch[pp]-'a']==NULL) return 0;
        p=p->next[ch[pp]-'a'];
        pp++;
    }
    return 0;
}
int main()
{
   // freopen("ACM.txt","r",stdin);
    head=(tree *)malloc(sizeof(tree));
    for(int i=0;i<26;i++)
        head->next[i]=NULL;
    //char a[12],b[12];
    //while(gets(a)&&a[0]!='')
    //{
    //    Insert(a);
    //}
    //while(scanf("%s",b)!=EOF)
    //{
    //   cout<<find(b)<<endl;
    //}

    return 0;
}