Leetcode|146. LRU 缓存机制（key2node哈希链表）

相关题目

《Leetcode|146. LRU 缓存机制（key2node哈希链表）》
《Leetcode|460. LFU 缓存（KV+KF+FK哈希链表+minFreq）》

解题过程

其实这里只要1个哈希链表足矣，代码不难，但一次写对不易

• 注意删除链表节点时，对应也要删除哈希表中的KV
• 添加链表节点时，也要在哈希表中添加KV

struct DListNode {
    int key, val;
    DListNode* prev;
    DListNode* next;
    DListNode(): key(0), val(0), prev(nullptr), next(nullptr) {}
    DListNode(int _key, int _val): key(_key), val(_val), prev(nullptr), next(nullptr) {} 
};

class LRUCache {
private:
    int size, capacity;
    DListNode* head;
    DListNode* tail;
    unordered_map<int, DListNode*> key2node;
public:
    LRUCache(int _capacity): capacity(_capacity), size(0) {
        head = new DListNode();
        tail = new DListNode();
        head->next = tail;
        tail->prev = head;
    }
    
    int get(int key) {
       if (key2node.count(key)) {
            makeRecent(key);
            return key2node[key]->val;
        }
        return -1;
    }
    
    void put(int key, int value) {
        if (key2node.count(key)) {
            key2node[key]->val = value;
            makeRecent(key);
            return;
        }
        if (capacity == size)
            removeLongestKey();
        addRecentKey(key, value);
    }

    void makeRecent(int key) {
        // 取出待提升优先级key对应的node
        auto node = key2node[key];
        // 在双链表中删除该节点
        node->prev->next = node->next;
        node->next->prev = node->prev;
        // 将该节点插入到双链表中尾部
        node->prev = tail->prev;
        node->next = tail;

        tail->prev->next = node;
        tail->prev = node;
    }

    void removeLongestKey() {
        // 删除哈希表对应KV
        key2node.erase(head->next->key);
        // 删除双链表对应KV
        auto deletenode = head->next;
        deletenode->next->prev = head;
        head->next = deletenode->next; 
        size--;
    }

    void addRecentKey(int key, int value) {
        auto node = new DListNode(key, value);
        // 更新双链表
        node->prev = tail->prev;
        node->next = tail;
        tail->prev->next = node;
        tail->prev = node;
        // 更新哈希表
        key2node[key] = node;
        size++;
    }
};

/**
 int main() {
    LRUCache lru(2);
    lru.put(1, 1);
    lru.put(2, 2);
    cout << lru.get(1) << endl;
    lru.put(3, 3);
    cout << lru.get(2) << endl;
    lru.put(4, 4);
    cout << lru.get(1) << endl;
    cout << lru.get(3) << endl;
    cout << lru.get(4) << endl;
    return 0;
}
 */

致谢

图片来源于「labuladong」公众号，欢迎大家关注这位大佬的公号