LeetCode208.Implement-Trie-Prefix-Tree<实现 Trie (前缀树)>
题目:思路:tire树,学过,模板题。一种数据结构与算法的结合吧。代码是://codeclassTrie{private:boolisEnd;Trie*next[26];public:Trie(){isEnd=false;memset(next,0,sizeof(next));}voidinsert(stringword){Trie*node=this;for(charc:word){if(nod