LRU
1 DLinkedNode{key, value,prev,next}2 HashMap cache,size,capacity,head,tail3 LRUCache{size,capacity,head,tail}4 get5 put6 addToHead7 removeNode8 moveToHead9 removeTailpublic class LRUCache { class DLinkedNode { int key; int valu
原创
2021-02-18 19:04:34 ·
78 阅读 ·
0 评论