题意:给你一堆电话号,是否存在某个电话号是另一个电话号的前缀,存在输出NO,否则输出YES
思路:存入每个电话号的时候判断两点,如果没有新建节点或者插入的时候遇到了val[u]!=0的情况就是NO,前者是先插入1111,后插入11这种,后者是相反的
Trie第一道题,留念。。
代码:
<span style="font-family:Microsoft YaHei;">#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int maxnode = 100010;
const int sigma_size = 10;
struct Tire{
int ch[maxnode][sigma_size];
int val[maxnode];
int sz;
void init(){
memset(ch[0],0,sizeof(ch[0]));
sz = 1;
val[0] = 0;
}
int idx(char c){return c - '0';}
bool insert(char *s,int v = 1){
int u = 0,n = strlen(s);
bool ok = 1,nn = 0;
for(int i = 0;i < n;i ++){
int c = idx(s[i]);
if(!ch[u][c]){
memset(ch[sz],0,sizeof(ch[sz]));
val[sz] = 0;
ch[u][c] = sz++;
nn = true;
}
u = ch[u][c];
if(val[u])ok = false;
}
val[u] = v;//cout<<nn<<' '<<ok<<endl;
if(nn == 0||ok == 0)return false;
else return true;
}
}phone;
int main(){
int t;
scanf("%d",&t);
char s[15];
while(t--){
phone.init();
int n;
scanf("%d",&n);
bool ok = 1;
while(n--){
scanf("%s",s);
bool now = phone.insert(s);
if(!now)ok = false;
}
if(ok)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
</span>