01. 字典树知识 #64
utterances-bot
started this conversation in
Comments
Replies: 2 comments
-
#3-字典树的实现代码 第30行一定要判断cur是None吗? 前面的循环不是保证了curr不会为None吗? 39行同理 |
Beta Was this translation helpful? Give feedback.
0 replies
-
写了个Trie 树的可视化操作页面,可以直观地了解 Trie 树的工作原理。 |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
01.字典树知识 | 算法通关手册
字典树知识 # 1. 字典树简介 # 字典树(Trie):又称为前缀树、单词查找树,是一种树形结构。顾名思义,就是一个像字典一样的树。它是字典的一种存储
https://algo.itcharge.cn/06.String/03.String-Multi-Pattern-Matching/01.Trie/
Beta Was this translation helpful? Give feedback.
All reactions