![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode整理 Design
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 · 650 阅读 · 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 · 441 阅读 · 0 评论 -
155. Min Stack
题目:Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top(转载 2016-07-17 23:09:28 · 456 阅读 · 0 评论 -
284. Peeking Iterator
题目:顶端迭代器Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek()operation -- it essentially peek() at the element转载 2016-07-31 15:09:38 · 405 阅读 · 0 评论