HDU 1761—简单的字典树,需要释放内存
来源:互联网 发布:开机自动还原软件 编辑:程序博客网 时间:2024/05/16 12:24
Phone List
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 17037 Accepted Submission(s): 5737
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
题目大意就是给你一堆电话号码,看看之前的电话有没有是当前电话的前缀的,有则输出NO,反之YES
#include <stdio.h>#include <algorithm>#include <string.h>#include <iostream>using namespace std;typedef struct Trie_Node{ struct Trie_Node* nexts[10]; bool exist;} TrieNode,*Trie;TrieNode* creat_node(){ TrieNode *node= new TrieNode; memset(node->nexts,NULL,sizeof(node->nexts)); node->exist=false; return node;}bool insertNode(TrieNode *root,char *str){ int id; TrieNode *p=root; for(int i=0;str[i];i++) { id=str[i]-'0'; if(p->nexts[id]==NULL) { p->nexts[id]=creat_node(); p=p->nexts[id]; } else { p=p->nexts[id]; if(p->exist) return true; } } p->exist=true; for(int i=0;i<10;i++)//这里也是个坑,就是当就是好之后看看当前串后面有没有别的串,如果有说明当前串为其他串的前缀。 if(p->nexts[i]!=NULL) return true; return false;}void release(TrieNode *root){ if(root==NULL) return ; for(int i=0; i<10; i++) if(root->nexts[i]!=NULL) release(root->nexts[i]); delete (root);}int main(){ int t,p; bool flag; char str[15]; scanf("%d",&t); while(t--) { flag=false; TrieNode* root=creat_node(); scanf("%d",&p); while(p--) { cin>>str; if(!flag) flag=insertNode(root,str); } // cout<<"**************"<<endl; if(!flag) printf("YES\n"); else printf("NO\n"); release(root); //这里很重要,要不MME } return 0;}
- HDU 1761—简单的字典树,需要释放内存
- hdu 1250 字典树+内存释放
- HDU 1671 字典树+释放内存
- HDU 1671 Phone List (字典树+释放内存)
- HDU 1671 简单字典树+内存清理
- 【字典树】HDU1671Phone List(论释放内存的重要性)
- hdu 1251 字典树的简单应用
- hdu1671-每个字典树都应该释放内存
- hdu 1251简单字典树
- HDU 1075(简单字典树)
- hdu 1251 简单字典树
- hdu 2846 简单字典树
- 一个需要手动释放引用,避免内存溢出的例子
- hdu-1247 简单map的应用。(字典树)
- hdu-1251统计难题-字典树的简单应用
- 种花家生日快乐! hdu 1251 简单的字典树
- HDU 1671 Trie树【 动态分配内存 + 内存释放 】
- HDU 1251 1671 (简单字典树)
- Scala学习笔记(一)基础
- CMake编译VS2015+OpenCV3.1第三方库
- 微软TTS语音引擎编程入门
- 第三章:iOS的数据存储与IO
- Opencv 实现图像的离散傅里叶变换(DFT)、卷积运算(相关滤波)
- HDU 1761—简单的字典树,需要释放内存
- Ubuntu 安装 OpenCV3.0, 遇到的问题集合 (Problems encountered in installing OpenCV3.0 on Ubuntu)
- 小坑:UITableView分组后最后一根分割线不显示
- 文件阅读(3)
- 常见的MD5和Base64加密
- C++11原子操作
- c++对象模型研究6:执行期
- iconfont、webfont的使用
- axis2--一个简单的webService