James Pan

原题网址：https://leetcode.com/problems/peeking-iterator/ Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operati

原题网址：https://leetcode.com/problems/lru-cache/ Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get

原题网址:http://www.lintcode.com/en/problem/memcache/ Implement a memcache which support the following features: get(curtTime, key). Get the key's value, return 2147483647 if key does not exis

原题网址：https://leetcode.com/problems/lfu-cache/ Design and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: getand put. get(key) -