hdu1251 tire树入门

来源：互联网发布：蒙古西征知乎编辑：程序博客网时间：2024/06/08 11:12

#include<stdio.h>#include<string>#include<map>#include<vector>#include<cmath>#include<stdlib.h>#include<string.h>#include<algorithm>#include<iostream>using namespace std;const int N=1e4+10;const int MOD=1e9+7;int n,m,k;struct node{    node* child[26];    int cnt;    node(){        cnt=0;        for(int i=0;i<26;i++) child[i]=NULL;    }};node *root=new node;node *p,*newp;void insert(char* s){     p=root;     int c;     int len=strlen(s)-1;     for(int i=0;i<len;i++){         c=s[i]-'a';         if(p->child[c]!=NULL){            p=p->child[c];            p->cnt++;         }else{            newp=new node;            p->child[c]=newp;            p=newp;            p->cnt++;         }     }}int search(char *s){    int len=strlen(s);    p=root;    for(int i=0;i<len;i++){        int c=s[i]-'a';        if(p->child[c]==NULL) return 0;        else p=p->child[c];    }    return p->cnt;}int main(){#ifndef ONLINE_JUDGE    freopen("aaa","r",stdin);#endif    int T;    char str[20];    while(fgets(str,100,stdin),strlen(str)!=1) insert(str);    while(~scanf("%s",str)) printf("%d\n",search(str));    return 0;}

0 0