HDU
来源:互联网 发布:路由器显示网络不可用 编辑:程序博客网 时间:2024/06/04 19:08
HDU - 1671 Phone List
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.
2391197625999911254265113123401234401234598346
NOYES
题意:
求是否存在某串是另一个串的前缀
思路:
刚学字典树,可以用字典树,先存下所有字符串,然后按字典序从大到小排序。当添加节点时判断此时进去的字符串最后一个节点是否在另一个串中存在(此前已排序),若 cnt 值不为一则此串是某一个串的前缀。
代码:
#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<algorithm>using namespace std;//重点是简便的清空字典树的应用,用数组结构的清空效率高 struct trie{trie *Next[15];char ch;int cnt;}bee[1000005];char s[25];int f[15];int o;//记录数组个数 trie *creat(trie *root,char ch){root = &bee[o++];//赋值操作 ,相当于//root = (trie*)malloc(sizeof(root)); for(int i = 0; i < 15; i++){root->Next[i] = NULL;}root->ch = ch;root->cnt = 1;return root;}int add(trie *root,char p[]){int len=strlen(p);int k;for(int i = 0; i < len; i++){if(root->Next[p[i]-'0'] == NULL){trie *r = creat(r,p[i]);root -> Next[p[i]-'0'] = r;root = root->Next[p[i]-'0'];}else{root = root->Next[p[i]-'0'];root ->cnt++;}}return root->cnt;}struct data{char s[25];int len;}p[10005];bool cmp(data a,data b){return a.len>b.len;}int main(){int tt,t;scanf("%d",&tt);while(tt--){o = 0;memset(f,0,sizeof(f));int flag=1;scanf("%d",&t);//清空字典树 for(int i = 0; i < t*15; i++){for(int j = 0; j < 15; j++){bee[i].Next[j] = NULL;}}trie *root;root = &bee[o++];for(int i = 0; i < t; i++){//存入结构体 scanf("%s",p[i].s);p[i].len=strlen(p[i].s);}sort(p,p+t,cmp);//排序方便查找 for(int i=0;i<t;i++){int k=add(root,p[i].s);if(k>1){flag=0;break;}}if(flag)printf("YES\n");else printf("NO\n");}return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- Python查找一个文章里出现次数最多的10的单词
- A1025. PAT Ranking (25)
- STM32的RS485调试过程记录
- WXH♂Round
- STM32接收不定长数据
- HDU
- 锁的粒度:ThreadLocal、volatile、Atomic和Synchronized
- 扩展entity framework core 实现默认字符串长度,decimal精度,entity自动注册和配置
- [leetcode]546. Remove Boxes
- HDU 2044 一只小蜜蜂...
- 从头到尾打印链表
- 数据结构——五
- python 网络编程之socketserver模块
- linux下mysql忘记密码