trie
文章平均质量分 80
chuandalishuo
这个作者很懒,什么都没留下…
展开
-
208. Implement Trie (Prefix Tree)
Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs are consist of lowercase letters a-z. class TrieNode { boolean isWord = false; // Stri原创 2016-12-09 08:23:32 · 167 阅读 · 0 评论 -
211. Add and Search Word - Data structure design
Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only lett原创 2016-12-09 08:25:07 · 247 阅读 · 0 评论