题目： Implement a trie with insert, search, and startsWith methods. 链接： http://leetcode.com/problems/implement-trie-prefix-tree/ 7/14/201760%，照着课件代码改写的。 ...
分类：
其他好文 时间：
2017-07-15 10:03:28
阅读次数：
248
Implement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue. pop() -- Removes the element from in front ...
分类：
其他好文 时间：
2017-07-14 23:53:01
阅读次数：
224
Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and closing parentheses ), the plus + or ...
分类：
其他好文 时间：
2017-07-14 13:30:56
阅读次数：
154
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib ...
分类：
其他好文 时间：
2017-07-14 11:52:07
阅读次数：
151
Implement the following operations of a stack using queues. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. to ...
分类：
编程语言 时间：
2017-07-13 16:02:45
阅读次数：
148
https://leetcode.com/problems/implement-trie-prefix-tree/#/description Implement a trie with insert, search, and startsWith methods. Note:You may assu ...
分类：
其他好文 时间：
2017-07-11 19:13:14
阅读次数：
154
Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. 这个题考查的是KMP算法。先求特征向量，然后 ...
分类：
其他好文 时间：
2017-07-11 12:48:45
阅读次数：
150
Design and implement a data structure for a compressed string iterator. It should support the following operations: next and hasNext. The given compre ...
分类：
其他好文 时间：
2017-07-11 00:51:21
阅读次数：
284
This problem is notoriously hard to implement due to all the corner cases. Most implementations consider odd-lengthed and even-lengthed arrays as two ... ...
分类：
其他好文 时间：
2017-07-10 10:34:31
阅读次数：
155
Description Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Solution htt ...
分类：
其他好文 时间：
2017-07-08 10:11:46
阅读次数：
123
