电话列表(字典树)

161. 电话列表 - AcWing题库

#include <bits/stdc++.h>
#include <iostream>
#include<unordered_map>
#include<unordered_set>
#define x first
#define y second
#define  ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

using namespace std;

typedef  long  long LL ;
typedef  unsigned long  long ULL ;
typedef pair<int,int> PII ;
typedef pair<LL,int> PLI ;
const int N = 1e5 + 10;

int n,son[N][10],idx;
bool f[N];

bool insert(char *str)
{
    int p=0;
    bool has_new =0,has_found=0;
//是否创建了新的节点，是否存在字符串结尾的标志
    for(int i=0;str[i];i ++ )
    {
        int u= str[i] -'0';
        if(!son[p][u])
        {
            son[p][u] = ++idx;
            has_new = 1;
        }
        p = son[p][u];
        if(f[p]) has_found = 1;
    }
    f[p] = 1;

    return has_new && !has_found;
}


inline void solve()
{
    cin >> n ;
    memset(son, 0, sizeof(son));
    memset(f, 0, sizeof(f));
    idx=0;
    bool res =1;

    char str[20];
    for(int i=0;i<n; i++ )
    {
        cin >> str;if(!insert(str)) res =0;
    }
    if(res)puts("YES");
    else puts("NO");
}
signed main()
{
    ios

    int T=1;
    cin>>T;
    while(T -- )
    {
        solve();

    }


    return 0;
}