首页 > 代码库 > hdu1247 Hat’s Words 字典树
hdu1247 Hat’s Words 字典树
Problem Description
A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.
You are to find all the hat’s words in a dictionary.
You are to find all the hat’s words in a dictionary.
Input
Standard input consists of a number of lowercase words, one per line, in alphabetical order. There will be no more than 50,000 words.
Only one case.
Only one case.
Output
Your output should contain all the hat’s words, one per line, in alphabetical order.
Sample Input
a ahat hat hatword hziee word
Sample Output
ahat hatword题意:输入一连串的 单词 组成的字典输出字典中由两个其他单词组成的单词构造字典树即可。。。代码:#include<iostream> #include<cstdio> #include<cstring> using namespace std; struct node{ int last; //last用来判断是否为一个单词的最后一个字母 struct node *next[26]; node() //构造函数 { last=0; memset(next,NULL,sizeof(next)); } }*root; char str[50005][20]; int s=0; void insert_str(char *s) //构造字典树 { node *p=root; while(*s!='\0') { int d=*s-'a'; if(p->next[d]==NULL) { p->next[d]= new node(); p=p->next[d]; } else p=p->next[d]; s++; } p->last=1; return ; } int find2(char *s) { node *p=root; while(*s!='\0') { int d=*s-'a'; p=p->next[d]; if(p!=NULL) { if(p->last==1&&*(s+1)=='\0') //当后半部分为单词 且没有后缀 return 1; s++; } else return 0; } return 0; //重要 返回可能默认为1 } int find(char *s) { node *p=root; while(*s!='\0') { int d=*s-'a'; p=p->next[d]; if(p!=NULL) { if(p->last==1&&find2(s+1)) //当已经确认前半部分为一个单词 再确认后半部分是否为单词 return 1; s++; } else return 0; } return 0; } int main() { int i,j; root=new node(); // 根节点 while(scanf("%s",str[s])!=EOF) { insert_str(str[s]); s++; } for(i=0;i<s;i++) { if(find(str[i])) cout<<str[i]<<endl; } return 0; }
hdu1247 Hat’s Words 字典树
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。