go top

trie

  • n. (计算机)一种通过共享公共前缀存储字符串集合的树状数据结构,支持快速查找和前缀匹配;又称“字典树”“前缀树”“单词查找树”

网络释义专业释义英英释义

  字典树

...构找出Top K,时间复杂度为N O(logK)最终时间复杂度为O(N) + NO(logK)第二种解法:题目中有提到字符串的特点,可以用字典树(trie):特点是排序和保存大量的字符串,利用公共前缀来减少查询,也就是说关键字域存该字符串的出现次数,没有出现为0,最后10个元素...

基于596个网页-相关网页

  单词查找树

试着记住trie 术语trie(单词查找树)来源于单词retrieval(检索)的中间部分。它本来被人们读作tree,好在现在常见读法已经将其读为发音有区别的try了。

基于124个网页-相关网页

  前缀树

Trie(前缀树)就是其中之一,它通过在树上对不同字符串的相同字符只记录一次,来实现对多个字符串的"压缩":可以认为多个字符串被压成了一个超...

基于98个网页-相关网页

短语

Trie Tree 字典树 ; trie树

binary trie 二叉线索

quad trie 四元线索

trie树 trie tree

Trie-tree Trie树

Double-array Trie 双数组Trie

 更多收起网络短语
  • 特里结构
  • 线索

·2,447,543篇论文数据,部分数据来源于NoteExpress

Trie

  • abstract: A trie for keys "A", "to", "tea", "ted", "ten", "i", "in", and "inn".

以上来源于: WordNet

双语例句权威例句

  • youdao

  • For example, if the word "dog" were stored in a trie as a node, it would descend from the node containing "do," which would descend from the node containing "d."

    例如,如果单词“dog”被存储为trie中的一个节点,它将是包含“do”的节点的后代,而后者又是包含“d”的节点的后代。

    youdao

  • A trie (the name comes from the word retrieval) is made up of a series of nodes where the descendants of a given node have the same prefix of the string associated with that node.

    trie(此名源于单词retrieval)由一系列的节点组成,其中,一个给定节点的后代具有与该节点关联的相同的字符串前缀。

    youdao

更多双语例句
  • But the judge sternly rejected the efforts and ordered Trie to a Washington halfway house 24-hours-a-day.

    CNN: By Terry Frieden/

  • His attorneys insisted Trie's effort to get a new passport did not reflect a desire to flee.

    CNN: By Terry Frieden/

  • In December, restrictions on Trie had been tightened to limit his movement to the Virginia Beach area.

    CNN: By Terry Frieden/

更多权威例句
$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定