leetcode-146. LRU 缓存机制

struct DLinkedNode{
int key,value;
DLinkedNode *prev,*next;
};

unordered_mapcache;
DLinkedNode* head,*tail;
int size;
int capacity;

LRUCache(int _capacity):capacity(_capacity),size(0) {
head = new DLinkedNode;
tail = new DLinkedNode;
head->next = tail;
tail->prev = head;
}

leetcode-146. LRU 缓存机制最先出现在Python成神之路。