HDU 1671 Phone List 字典树

Phone List
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15991 Accepted Submission(s): 5384

Problem Description
Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:
1. Emergency 911
2. Alice 97 625 999
3. Bob 91 12 54 26
In this case, it’s not possible to call Bob, because the central would direct your call to the emergency line as soon as you had dialled the first three digits of Bob’s phone number. So this list would not be consistent.

Input
The first line of input gives a single integer, 1 <= t <= 40, the number of test cases. Each test case starts with n, the number of phone numbers, on a separate line, 1 <= n <= 10000. Then follows n lines with one unique phone number on each line. A phone number is a sequence of at most ten digits.

Output
For each test case, output “YES” if the list is consistent, or “NO” otherwise.

Sample Input
2
3
911
97625999
91125426
5
113
12340
123440
12345
98346

Sample Output
NO
YES

本来想用map做的,做了半天发现各种问题,sting不会用,用字符串有些功能又实现不了,各种纠结,索性开始学写字典树,一个月前看字典树的代码还啥都不懂的,昨天去看竟然看懂了,还明白了其中的含义!还是比较有进展的,人生第一道字典树。
#include <iostream>
#include <cstring>
#include <stdlib.h>
using namespace std;
typedef struct Trie{
    int v;
    Trie *next[10];

}Trie;
Trie *root;
void CreateTrie(char * str)
{
    Trie *p=root,*q;
    int l=strlen(str);
    for(int i=0;i<l;++i)
    {
    int id=str[i]-'0';  
    if(p->next[id]==NULL)
    {
        q=( Trie *)malloc(sizeof(Trie));
        q->v=1;//这里!就是因为这里没写,贡献了N个WA!!!! 
        for(int j=0;j<10;j++)
            {
            q-> next[j]=NULL;
            }
        p->next[id]=q;
        p=p->next[id];  
    }
    else 
        {
        p=p->next[id];
        p->v++;
        }
    }
    p->v=-1;
}
int FindTrie(char * str)
{
    Trie *p=root,*q;
    int l=strlen(str);
    for(int i=0;i<l;i++)
    {
        int id=str[i]-'0';
        if(p->next[id]==NULL)
        {
            return -1;//没有找到 
        }
        else if(p->next[id]->v==-1)
        return 0;//该串比较长,原来有比这个短的串 
        else p=p->next[id]; 

    }
    return 0;//该串太短了,是某个串的子串 


}
void delTrie(Trie * T)
{
    for(int i=0;i<10;i++)
    if(T->next[i]!=NULL)
    {
        delTrie(T->next[i]);
    }
    free(T);
} 
int main(int argc, char *argv[])
{
    int t,n;
    cin>>t;
    char str[15];
    int flag=0;
    while(t--)
    {
        cin>>n;
        flag=0;
        root=( Trie *)malloc(sizeof(Trie));
        for(int j=0;j<10;j++)
        root->next[j]=NULL;
        while(n--)
        {
            cin>>str;
            if(flag==1)
            continue;
            if(FindTrie(str)==0)//有冲突 
            flag=1;
            if(flag==1)
            continue;
            CreateTrie(str);

        }
        if(flag==1)
        cout<<"NO"<<endl;
        else 
        cout<<"YES"<<endl;
        delTrie(root);

    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值