classDListNode{public:intkey;intvalue;DListNode*prev;DListNode*next;DListNode():key(0),value(0),prev(nullptr),next(nullptr){};DListNode(intkey_,intvalue_):key(key_),value(value_),prev(nullptr),next(nullptr){}};classLRUCache{private:DListNode*head;DListNode*tail;unordered_map<int,DListNode*>cache;intsize;intcapacity;voidaddToHead(DListNode*node){node->prev=head;node->next=head->next;head->next->prev=node;head->next=node;}voidremoveNode(DListNode*node){node->prev->next=node->next;node->next->prev=node->prev;}voidmoveToHead(DListNode*node){removeNode(node);addToHead(node);}DListNode*removeTail(){DListNode*node=tail->prev;removeNode(node);returnnode;}public:LRUCache(intcapacity){this->capacity=capacity;head=newDListNode();tail=newDListNode();head->next=tail;tail->prev=head;size=0;}intget(intkey){if(!cache.count(key))return-1;DListNode*node=cache[key];moveToHead(node);returnnode->value;}voidput(intkey,intvalue){if(cache.count(key)){DListNode*node=cache[key];moveToHead(node);node->value=value;}else{DListNode*node=newDListNode(key,value);addToHead(node);cache[key]=node;++size;if(size>capacity){DListNode*t=removeTail();cache.erase(t->key);deletet;--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); */