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
题意:LRU ( Least Recently Used) 表示最近最长使用的缓存。
LRU的基本原理如下:缓存区大小如下,依次放入A, B, C, D,E。此时缓存满,放入F时,将移除最早放入而且没有被访问过的A。放入C时,由于C已经在缓存中,将其移至缓存区头部即可。放入G时,会移除最早放入而且没有被访问过的B。
代码如下:
class LRUCache {
public:
LRUCache(int capacity) :_capacity(capacity) {
}
int get(int key) {
if (_dataMap.find(key) == _dataMap.end())
{
return -1;
}
_data.erase(_iterMap[key]);
_data.push_front(key);
_iterMap[key] = _data.begin();
return _dataMap[key];
}
void put(int key, int value) {
if (_dataMap.find(key) != _dataMap.end())
{
_data.erase(_iterMap[key]);
}
else
{
//缓冲已满
if (_data.size() >= _capacity)
{
_iterMap.erase(_data.back());
_dataMap.erase(_data.back());
_data.erase(--_data.end());
}
}
_data.push_front(key);
_iterMap[key] = _data.begin();
_dataMap[key] = value;
}
private:
int _capacity;
list<int> _data;
map<int, list<int>::iterator> _iterMap;
map<int, int> _dataMap;
};
/**
* Your LRUCache object will be instantiated and called as such:
* LRUCache* obj = new LRUCache(capacity);
* int param_1 = obj->get(key);
* obj->put(key,value);
*/