LRU
1 DLinkedNode{key, value,prev,next}
2 HashMap cache,size,capacity,head,tail
3 LRUCache{size,capacity,head,tail}
4 get
5 put
6 addToHead
7 removeNode
8 moveToHead
9 removeTail
public class LRUCache {
class DLinkedNode {
int key;
int valu
原创
2021-02-18 19:04:34 ·
99 阅读 ·
0 评论