跳转至

146 LRU缓存

class DListNode {
public:
    int key;
    int value;
    DListNode* prev;
    DListNode* next;
    DListNode():key(0), value(0),prev(nullptr),next(nullptr){};
    DListNode(int key_, int value_) : key(key_), value(value_),prev(nullptr),next(nullptr) {}
};

class LRUCache {
private:
    DListNode* head;
    DListNode* tail;
    unordered_map<int, DListNode*> cache;
    int size;
    int capacity;

    void addToHead(DListNode* node) {
        node->prev = head;
        node->next = head->next;
        head->next->prev = node;
        head->next = node;
    }

    void removeNode(DListNode* node) {
        node->prev->next = node->next;
        node->next->prev = node->prev;
    }

    void moveToHead(DListNode* node) {
        removeNode(node);
        addToHead(node);
    }

    DListNode* removeTail() {
        DListNode* node = tail->prev;
        removeNode(node);
        return node;
    }

public:
    LRUCache(int capacity) {
        this->capacity = capacity;
        head = new DListNode();
        tail = new DListNode();
        head->next = tail;
        tail->prev = head;
        size = 0;
    }

    int get(int key) {
        if (!cache.count(key))
            return -1;
        DListNode* node = cache[key];
        moveToHead(node);
        return node->value;
    }

    void put(int key, int value) {
        if (cache.count(key)) {
            DListNode* node = cache[key];
            moveToHead(node);
            node->value = value;
        } else {
            DListNode* node = new DListNode(key, value);
            addToHead(node);
            cache[key] = node;
            ++size;
            if (size > capacity) {
                DListNode* t = removeTail();
                cache.erase(t->key);
                delete t;
                --size;
            }
        }
    }
};

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