146. LRU缓存机制

146. LRU缓存机制

思路

考虑使用双向链表+哈希，插入和更新直接移动到头结点即可

struct DoubleLink {
    int key, value;
    DoubleLink* prev;
    DoubleLink* next;
    DoubleLink(): key(0), value(0), prev(nullptr), next(nullptr) {}
    DoubleLink(int _key, int _value): key(_key), value(_value), prev(nullptr), next(nullptr) {}
};
class LRUCache {
private:
    unordered_map<int,DoubleLink*>cache;
    DoubleLink* head;
    DoubleLink* tail;
    int MAXSIZE,size;
public:
    LRUCache(int capacity) {
        head = new DoubleLink();
        tail = new DoubleLink();
        head->next = tail;
        tail->prev = head;
        this->MAXSIZE = capacity;
        this->size = 0;
    }
    int get(int key) {
       if(!cache[key])return -1;
        movetohead(cache[key]);
        return cache[key]->value;
    }
    void put(int key, int value) {
        if(!cache[key]){
            if(size>=MAXSIZE){
                delenode();
                this->size--;
            }
            DoubleLink * temp = new DoubleLink(key,value);
            cache[key] = temp;
            movetohead(temp);
            this->size++;
        }else{
            cache[key]->value = value;
            movetohead(cache[key]);
        }
    }
    void movetohead(DoubleLink *node){
        if(node->prev&&node->next){
        node->prev->next = node->next;
        node->next->prev = node->prev;
        }
        node->next =  head->next;
        head->next->prev = node;
        head->next = node;
        node->prev = head;
    }
    void delenode(){
        DoubleLink * temp = tail->prev;
        cache.erase(temp->key);
        temp->prev->next = tail;
        tail->prev = temp->prev;
        delete temp;
    }
    void inserttail(DoubleLink *node){
        tail->prev->next = node;
        node->prev = tail->prev;
        tail->prev = node;
        node->next = tail;
    }
};

/**
 * 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);
 */