C++,双向链表+哈希表结构(代码写的烂,求轻喷)
//LRU缓存结构
//哈希表+双向链表的结构
//链表中存放缓存<K,V>的值
#include <iostream>
#include <list>
#include <unordered_map>
using namespace std;
struct Node {
int m_key;
int m_value;
Node(int key, int value) :m_key(key), m_value(value) {
}
};
class LRUCache {
private:
int m_cap;
list<Node> m_list;
unordered_map<int, list<Node>::iterator> m_map;
public:
LRUCache(int capacity = 5) {
this->m_cap = capacity;
}
int