自己实现一个LRU缓存

#include <bits/stdc++.h>
using namespace std;

class Node{
public:
    int key;
    int value;
    Node* left;
    Node* right;
    Node(int x,int y): key(x),value(y),left(NULL),right(NULL){}
};
Node* dummyLeft = NULL;
Node* dummyRight = NULL;
int cap = 3;
unordered_map<int, Node*> mapLru;


void del(Node* node){
    node->right->left = node->left;
    node->left->right = node->right;
}

void insert(Node* node){
    node->right = dummyLeft->right;
    node->left = dummyLeft;
    dummyLeft->right->left = node;
    dummyLeft->right = node;
}

int get(int k){
    if(mapLru.count(k)==0){
        cout<<"查无此数";
        return -1;
    }
    auto node = mapLru[k];
    //把这个节点挪到链表的第一个位置
    del(node);
    insert(node);
    return node->value;
}

void put(int k, int val){
    if(mapLru.count(k)){
        auto node = mapLru[k];
        node->value = val;
        del(node);
        insert(node);
    }
    else{
        while(mapLru.size() >= cap){
            auto node = dummyRight->left;
            del(node);
            mapLru.erase(node->key);
            cout<<"容量大了"<<endl;
            delete node;
        }
        auto node = new Node(k,val);
        mapLru[k] = node;
        insert(node);
    }
}


int main() {
    //int a;
    //cin >> a;
    //cout << "Hello World!" << endl;
    //dummyLeft;
    //dummyRight;

    dummyLeft = new Node(-1,-1);
    dummyRight = new Node(-1,-1);

    Node* node1 = new Node(1,1);
    Node* node2 = new Node(2,2);
    Node* node3 = new Node(3,3);

    mapLru[1] = node1;
    mapLru[2] = node2;
    mapLru[3] = node3;

    dummyLeft->right = node3;
    node3->left = dummyLeft;
    node3->right = node2;
    node2->left = node3;
    node2->right = node1;
    node1->left = node2;
    node1->right = dummyRight;
    dummyRight->left = node1;

    put(4,4);
    cout<<get(1)<<endl;
    cout<<get(2)<<endl;
    cout<<get(4)<<endl;

    return 0;
}