LRU Cache

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 the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
set(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.

这是一道好题，使用C++11做代码简单：

 

private:
    struct CacheNode{
        int key;
        int value;
        CacheNode(int k,int v):key(k),value(v){}
    };
public:
    LRUCache(int capacity) {
        this->capacity =capacity;
    }
    
    int get(int key) {
        if(cacheMap.find(key) ==cacheMap.end())
            return -1;
        cacheList.splice(cacheList.begin(),cacheList,cacheMap[key]);//将cacheList里面cacheMap[key]的值移到cacheList的开头
        cacheMap[key] =cacheList.begin();
        return cacheMap[key]->value;
    }
    
    void set(int key, int value) {
        if(cacheMap.find(key) ==cacheMap.end())
        {
            if(cacheList.size() ==capacity)//删除链表尾部结点（最少访问的节点）
                {
                    cacheMap.erase(cacheList.back().key);
                    cacheList.pop_back();
                }
        //插入节点到链表尾头部，并且在map中增加该节点
        cacheList.push_front(CacheNode(key,value));
        cacheMap[key] =cacheList.begin();
        }else{
            cacheMap[key]->value =value;//cacheMap【key】 是一个指向结构体的指针
            cacheList.splice(cacheList.begin(),cacheList,cacheMap[key]);
            cacheMap[key] =cacheList.begin();//一个指针
        }
    }
    
private:
    list<CacheNode> cacheList;
    unordered_map<int,list<CacheNode>::iterator> cacheMap;
    int capacity;