字典树
努力前行吧
这个作者很懒,什么都没留下…
展开
-
Repository(字典树,避免重复计数)
RepositoryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2865 Accepted Submission(s): 1096Problem DescriptionWhen you go shoppin转载 2015-06-24 14:38:16 · 546 阅读 · 0 评论 -
动物统计加强版(字典树)
动物统计加强版时间限制:3000 ms | 内存限制:150000 KB难度:4描述在美丽大兴安岭原始森林中存在数量繁多的物种,在勘察员带来的各种动物资料中有未统计数量的原始动物的名单。科学家想判断这片森林中哪种动物的数量最多,但是由于数据太过庞大,科学家终于忍受不了,想请聪明如你的ACMer来帮忙。输入第一行输入动物名字的数量N(1输出输出转载 2015-07-12 16:34:13 · 326 阅读 · 0 评论 -
Flying to the Mars(字典树)
Flying to the MarsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12965 Accepted Submission(s): 4111Problem DescriptionIn转载 2015-06-14 20:09:28 · 1024 阅读 · 1 评论 -
Babelfish(字典树-map映射功能)
BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 35663 Accepted: 15256DescriptionYou have just moved from Waterloo to a big city. The people here转载 2015-07-02 22:04:24 · 479 阅读 · 0 评论 -
Hat’s Words(字典树)
Hat’s WordsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9455 Accepted Submission(s): 3377Problem DescriptionA hat’s word i转载 2015-06-14 16:35:55 · 749 阅读 · 0 评论 -
字典树
Trie,又称字典树,前缀树(prefix tree),是一种树形结构,用于保存大量的字符串。它的优点是:利用字符串的公共前缀来节约存储空间。查找、插入复杂度为O(n),n为字符串长度。 它有3个基本性质:1. 根节点不包含字符,除根节点外每一个节点都只包含一个字符。2. 从根节点到某一节点,路径上经过的字符连接起来,为该节点对应的字符串。3. 每个节点的所有子节点包含的字符都转载 2015-06-14 16:39:37 · 326 阅读 · 0 评论 -
Phone List(字典树,销毁树)
Phone ListTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12933 Accepted Submission(s): 4402Problem DescriptionGiven a list o转载 2015-07-14 15:23:29 · 418 阅读 · 0 评论 -
Immediate Decodability(字典树-判断是否存在前缀)
Immediate DecodabilityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2328 Accepted Submission(s): 1205Problem DescriptionAn转载 2015-08-30 09:01:15 · 496 阅读 · 0 评论