LeetCode 146：LRU Cache

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.

get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
put(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.

The cache is initialized with a positive capacity.

Follow up:
Could you do both operations in O(1) time complexity?

Example:

LRUCache cache = new LRUCache( 2 /* capacity */ );

cache.put(1, 1);
cache.put(2, 2);
cache.get(1);       // returns 1
cache.put(3, 3);    // evicts key 2
cache.get(2);       // returns -1 (not found)
cache.put(4, 4);    // evicts key 1
cache.get(1);       // returns -1 (not found)
cache.get(3);       // returns 3
cache.get(4);       // returns 4

 

解法一：使用LinkedHashMap 

LinkedHashMap本身的实现保证了插入的顺序性。

每次插入新数据的时候直接插到尾部

每次修改/读取数据时将数据移除并重新创建（即，挪到尾部）

当达到capacity时，链表头部元素即为最不常使用的元素，直接移除掉即可

 

解法二：双向链表

基本思想与解法一完全一样。其实LinkedHashMap底层实现也是通过双向链表实现的