字典树
李逝水
这个作者很懒,什么都没留下…
展开
-
What Are You Talking About
What Are You Talking About Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others) Total Submission(s): 8905 Accepted Submission(s): 2790 Problem Description转载 2013-04-12 21:25:31 · 658 阅读 · 0 评论 -
Phone List
Phone List Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6320 Accepted Submission(s): 2152 Problem Description Given a list of pho转载 2013-04-17 13:24:14 · 590 阅读 · 0 评论 -
字典树(讲解+模版)
字典树(讲解+模版) 又称单词查找树,Trie树,是一种树形结构,是一种哈希树的变种。典型应用是用于统计,排序和保存大量的字符串(但不仅限于字符串),所以经常被搜索引擎系统用于文本词频统计。它的优点是:利用字符串的公共前缀来节约存储空间,最大限度地减少无谓的字符串比较,查询效率比哈希表高。 字典树与字典很相似,当你要查一个单词是不是在字典树中,首先看单词的转载 2013-04-17 13:11:14 · 433 阅读 · 0 评论 -
Flying to the Mars
Flying to the Mars Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7563 Accepted Submission(s): 2444 Problem Description In原创 2013-04-18 13:57:10 · 391 阅读 · 0 评论 -
统计难题
统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 12588 Accepted Submission(s): 5311 Problem Description Ignatius最近遇到一个难题,老师交给他很原创 2013-04-29 18:17:20 · 405 阅读 · 0 评论