搜索资源列表
DictionaryTree
- 字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构-Dictionary tree algorithm, can be very convenient multi-tree, and find very convenient is the design of ACM algorithms commonly used data structure
DictionaryTree
- 字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构-Dictionary tree algorithm, can easily multi-tree, and find it convenient, it is commonly used in ACM algorithm design data structures
dictionarytree
- 又称单词查找树，Trie树，是一种树形结构，是一种哈希树的变种。典型应用是用于统计，排序和保存大量的字符串（但不仅限于字符串），所以经常被搜索引擎系统用于文本词频统计-Also known as word search tree, the trie is a tree structure, which is a variant of the hash tree. Typical applications are used for sta
NYOJ.290.DictionaryTree
- 字典树，Trie树，查找插入效率都很高的一种高级数据结构。-Dictionary tree, Trie, an advanced data structures to find the insertion efficiency high.
dictionarytree
- 利用huffman字典树，对输入语句单词进行统计(Use the Huffman dictionary tree to count the input statement words)