HDU1671 poj3630 Phone List 字典树

来源：互联网发布：bigger研究所知乎编辑：程序博客网时间：2024/05/06 11:45

字典树都是套模版的这是学长跟我说的，有指针型跟数组型，贴个数组型的以后留着看，今天搞懂了

#include<iostream>#include<cstdio>#include<list>#include<algorithm>#include<cstring>#include<string>#include<queue>#include<stack>#include<map>#include<vector>#include<cmath>#include<memory.h>#include<set>#define ll long long#define LL __int64const ll INF=9999999999999;using namespace std;#define M 400000100#define inf 0xfffffff//vector<int> G[10002];//vector<pair<int,int>> ::iterator iter;//map<ll,int>mp;//map<ll,int>::iterator p;int Trie[100002][11];//表示节点数int node[100002];//当前节点的单词数目int value[100002];//当前节点所附带的信息int sizeofTrie;  //节点数目void clear()//初始化{memset(Trie[0],0,sizeof(Trie[0]));memset(node,0,sizeof(node));memset(value,0,sizeof(node));sizeofTrie=1;}bool buildTrie(char *s){bool have_build=0;//判断树是否新建了int u=0,len=strlen(s);for(int i=0;i<len;i++){int v=s[i]-'0';if(!Trie[u][v])//节点不存在{memset(Trie[sizeofTrie],0,sizeof(Trie[sizeofTrie]));Trie[u][v]=sizeofTrie++;have_build=1;}if(node[u]==1)return 0;u=Trie[u][v];}if(node[u]==1)return 0;node[u]=1;return have_build;}int main(void){char s[22];int n;int t;cin>>t;while(t--){clear();scanf("%d",&n);bool flag=1;for(int i=0;i<n;i++){scanf("%s",s);if(flag)flag=buildTrie(s);}if(flag)puts("YES");elseputs("NO");}}