自己实现一个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-&