LRU缓存

class LRUCache{
    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]);
        cacheMap[key] = cacheList.begin();
        return cacheMap[key]->value;
           
    }
    
    void set(int key, int value) {
        //unordered_map::iterator it = cacheMap.find(key);
        if( cacheMap.find(key) == cacheMap.end())
        {
            if(cacheList.size() == this->capacity)
            {
                cacheMap.erase(cacheList.back().key);
                cacheList.pop_back();
            }
            cacheList.push_front(CacheNode(key,value));
            cacheMap[key] = cacheList.begin();
        }
        else 
        {
            cacheMap[key]->value = value;
            cacheList.splice(cacheList.begin(),cacheList,cacheMap[key]);
            cacheMap[key] = cacheList.begin();
        }
        
        
    }
    private:
    list<CacheNode> cacheList;
    int capacity;
    unordered_map<int,list<CacheNode>::iterator> cacheMap;
};