Leetcode 146. LRU 缓存机制

最新推荐文章于 2024-01-26 00:57:03 发布

༄yi笑奈何

最新推荐文章于 2024-01-26 00:57:03 发布

阅读量193

点赞数

本文链接：https://blog.csdn.net/qq_40179458/article/details/110222423

版权

本文介绍了一种使用双链表和哈希表实现的LRU(Least Recently Used)缓存机制。通过自定义节点结构并结合双向链表的数据结构特点，实现了高效的插入和删除操作。同时利用哈希表快速查找节点，确保了缓存操作的时间复杂度较低。

摘要由CSDN通过智能技术生成

原题链接

题解：双链表+哈希表

class LRUCache {
public:
    struct Node {
        int key, val;
        Node *left, *right;
        Node(int _key, int _val): key(_key), val(_val), left(NULL), right(NULL) {}
    }*L, *R;
    unordered_map<int, Node*> hash;
    int n;

    void remove(Node* p) {
        p->right->left = p->left;
        p->left->right = p->right;
    }

    void insert(Node* p) {
        p->right = L->right;
        p->left = L;
        L->right->left = p;
        L->right = p;
    }

    LRUCache(int capacity) {
        n = capacity;
        L = new Node(-1, -1), R = new Node(-1, -1);
        L->right = R, R->left = L;
    }

    int get(int key) {
        if (hash.count(key) == 0) return -1;
        auto p = hash[key];
        remove(p);
        insert(p);
        return p->val;
    }

    void put(int key, int value) {
        if (hash.count(key)) {
            auto p = hash[key];
            p->val = value;
            remove(p);
            insert(p);
        } else {
            if (hash.size() == n) {
                auto p = R->left;
                remove(p);
                hash.erase(p->key);
                delete p;
            }
            auto p = new Node(key, value);
            hash[key] = p;
            insert(p);
        }
    }
};

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