leetcode整理 Trie
StudyCoder
这个作者很懒,什么都没留下…
展开
-
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. 题意: 实现字典树,包含插入,查找和前缀查找方法。 Note:转载 2016-07-17 16:24:43 · 680 阅读 · 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 stri转载 2016-07-17 16:52:25 · 490 阅读 · 0 评论