hdu 1671 Phone List

 Trie 树裸题，写tire 的时候应该想想trie的图，当前的str【0】应该为下一步要走的边。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
const int maxnode = 100001;
int ch[maxnode][10],isend[maxnode],tot = 0;
bool insrt( int x,char* str,bool f ){
    if( isend[x] ) return false;
    if( str[0] == '\0' ){
        isend[x] = 1;
        return f;
    }
    if(!ch[x][str[0]-'0'] )f = true,ch[x][str[0]-'0']=++tot;
    x = ch[x][str[0]-'0'];
    return insrt( x,str+1,f );
}
char str[maxn];
int main(){
    int T,n;
    scanf("%d",&T);
    while(T--){
        tot  =0;
        scanf("%d",&n);
        bool flag = true;
        for( int i = 1;i <= n;i++ ){
            scanf("%s",str);
            if(flag)flag = insrt(0,str,false);
        }
        if( flag ){
            printf("YES\n");
        }else printf("NO\n");
        for( int i = 1;i <= tot;i++ ) isend[i] = 0;
        memset( ch,0,sizeof(ch) );
    }
    return 0;
}