![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
trie树
文章平均质量分 72
thunderMrbird
西北工业大学-李丰基
展开
-
HDU1251统计难题 trie树
Description Ignatius最近遇到一个难题, 老师交给他很多单词( 只有小写字母组成, 不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量( 单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表, 每行一个单词, 单词的长度不超过10, 它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是原创 2016-07-24 17:24:06 · 528 阅读 · 0 评论 -
poj2001 Shortest Prefixes trie树
Description A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "car", "carb", "carbo", and "carbon". Note that the empty str原创 2016-07-25 16:09:04 · 312 阅读 · 0 评论 -
hdu1247 Hat's words trie树
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. In原创 2016-07-29 15:23:08 · 458 阅读 · 0 评论