LRUCache

<span style="font-family: Arial, Helvetica, sans-serif;">struct cacheNode</span>

{
    int key;
    int value;
    cacheNode(int k,int v):key(k),value(v){}
};

class LRUCache
{
private:
    int capacity;
    list<cacheNode> cacheList;
    unordered_map<int,list<cacheNode>::iterator> cacheMap;

public:
    LRUCache(int capacity)
    {
        this->capacity = capacity;        
    }
    int get(int key)
    {
        if(cacheMap.find(key) != cacheMap.end())
        {
            cacheList.splice(cacheList.begin(),cacheList,cacheMap[key]);
            return cacheMap[key]->value;
        }
        return -1;
    }

    void set(int key,int value)
    {
        if(cacheMap.find(key) != cacheMap.end())
        {
            cacheList.splice(cacheList.begin(),cacheList,cacheMap[key]);           
            cacheMap[key]->value = value;
        }        
        else
        {
            if(capacity == cacheMap.size())
            {
                cacheMap.erase(cacheList.back().key);
                cacheList.pop_back();
            }
            cacheList.push_front(cacheNode(key,value));
            cacheMap[key] = cacheList.begin();
        }
    }
};

1.用列表存放cache的值，特别注意函数splice的用法，表示剪接的意思；

2.第一次用到unordered_map，这是c++11里新添加的类，注意多多学习。它要比map的时间复杂度低，t(map)=O(lgn)，而t(unordered_map)=O(1)。而且，unordered_map是散列表hash存储，key的排序是乱序的，map中key的排序是按升序来的。

3.iterator可视为指针