![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Trie树
zhaohoutao
这个作者很懒,什么都没留下…
展开
-
LeetCode 208 实现 Trie (前缀树)
实现 Trie (前缀树)struct Node { bool isWord = false; Node* child[26] = {};};class Trie { public: Node* root; /** Initialize your data structure here. */ Trie() { root = new Node(); } /**...原创 2019-08-20 18:40:21 · 141 阅读 · 0 评论 -
LeetCode 212 单词搜索 II
单词搜索 IIclass Solution {public: struct Node { int val; Node* child[26]; bool isWord = false; Node() { for (int i = 0; i < 26; ++i) child[i] = NULL; } }; Node* root=new No...原创 2019-08-29 21:46:32 · 259 阅读 · 0 评论