LRU Cache

细节实现题，使用一个双向链表std::list和一个hash表实现O(1)时间内对节点的访问，有保证了节点的有序性（记录最后被访问的先后顺序）。需要注意实现的细节，多练习。

class LRUCache{
public:
    struct CacheNode
    {
        int key;
        int value;
        CacheNode(int k, int v): key(k), value(v){}
    };

    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 cacheList.begin()->value;
    }
    
    void set(int key, int value) {
        //cannot use [] here, since [] will insert an element
        //if not exist
        if(cacheMap.find(key) == cacheMap.end())
        {
            if(cacheList.size() == 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;
        unordered_map<int, list<CacheNode>::iterator> cacheMap;
        int capacity;
};