hiho1014(trie树)

题目连接：https://hihocoder.com/problemset/problem/1014

#include<cstdio>
#include<cstring>
const int maxn=110;
struct trie
{
    char a;
    int cnt;
    trie* nex[26];
    trie()
    {
        cnt=0;
        memset(nex,NULL,sizeof(nex));
    }
    void init()
    {
        cnt=0;
        memset(nex,NULL,sizeof(nex));
    }
};
trie rt;
int ans;

inline int id(char c)
{
    return c-'a';
}

void inser(char *s)
{
    int len=strlen(s);
    trie* head=&rt;
    for(int i=0;i<len;i++)
    {
        if(head->nex[id(s[i])]==NULL)
        {
            trie *node=new trie;
            node->a=s[i];
            head->nex[id(s[i])]=node;
        }
        head=head->nex[id(s[i])];
        head->cnt++;
    }
}
void fin(char *s)
{
    int len=strlen(s);
    trie *head=&rt;
    ans=0;
    for(int i=0;i<len;i++)
    {
        if(head->nex[id(s[i])]==NULL) return;
        head=head->nex[id(s[i])];
    }
    ans=head->cnt;
}
int main()
{
    char s[maxn];
    int n,m;
    while(scanf("%d",&n)!=EOF)
    {
        rt.init();
        for(int i=0;i<n;i++)
        {
            scanf("%s",s);
            inser(s);
        }
        scanf("%d",&m);
        while(m--)
        {
            scanf("%s",s);
            fin(s);
            printf("%d
",ans);
        }
    }
}

上面是之前用指针写的

#include <bits/stdc++.h>
using namespace std;
#define CLR(m,a) memset(m,a,sizeof(m))
const int maxnode=1000010;
const int sigma=26;

struct Trie
{
    int ch[maxnode][sigma];
    int val[maxnode];
    int sz;

    int ans;
    void init(){sz=1;CLR(ch[0],0);val[0]=0;}
    int idx(char c) {return  c-'a';}
    void inser(char *s,int v)
    {
        int u=0,n=strlen(s);
        for(int i=0;i<n;i++){
            int c=idx(s[i]);
            if(!ch[u][c]){
                CLR(ch[sz],0);
                val[sz]=0;
                ch[u][c]=sz++; //建立新节点
            }
            u=ch[u][c];
            val[u]++;  //有单词经过
        }
      //  val[u]+=v;  //更新节点挂载的信息
    }

    int fin(char *s)
    {
        ans=0;
        int u=0,n=strlen(s);
        for(int i=0;i<n;i++){
            int c=idx(s[i]);
            if(!ch[u][c]) return 0;
            u=ch[u][c];
        }
        return val[u];
    }
};

Trie trie;

int main()
{
    int n,m;
    while(scanf("%d",&n)!=EOF){
        trie.init();
        char s[15];
        for(int i=0;i<n;i++){
            scanf("%s",s);
            trie.inser(s,1);
        }
        scanf("%d",&m);
        while(m--){
            scanf("%s",s);
            int ans=trie.fin(s);
            printf("%d
",ans);

        }
    }
}