leetcode 146. LRU Cache
看了Discuss理解了,关键是:
- 用了一个doublely linkedlist 来记录order. 用了head, tail避免corner case里面npe.
- 用了HashMap记录key和相应node的位置.
- 用到的function和parameter比较多, 安全起见多用this关键字,防止collision.
class LRUCache {
private class DLinkedNode {
int key;
int value;
DLinkedNode pre;
DLinkedNode post;
}
private Map<Integer, DLinkedNode> cache = new HashMap<>();
private int count;
private int capacity;
private DLinkedNode head, tail;
// add new node right after head
private void addNode (DLinkedNode node) {
node.pre = head;
node.post = head.post;
head.post.pre = node;
head.post = node;
}
// remove an existing node from the linked list
private void removeNode(DLinkedNode node) {
DLinkedNode pre = node.pre;
DLinkedNode post = node.post;
pre.post = post;
post.pre = pre;
}
// move certain node in between to the head.
private void moveToHead(DLinkedNode node) {
this.removeNode(node);
this.addNode(node);
}
// pop the current tail
private DLinkedNode popTail() {
DLinkedNode res = tail.pre;
this.removeNode(res);
return res;
}
public LRUCache(int capacity) {
count = 0;
this.capacity = capacity;
head = new DLinkedNode();
head.pre = null;
tail = new DLinkedNode();
tail.post = null;
head.post = tail;
tail.pre = head;
}
public int get(int key) {
DLinkedNode node = cache.get(key);
if (node == null) {
return -1; //
}
// move the accessed node to the head;
this.moveToHead(node);
return node.value;
}
public void put(int key, int value) {
DLinkedNode node = cache.get(key);
if (node == null) {
DLinkedNode newNode = new DLinkedNode();
newNode.key = key;
newNode.value = value;
this.cache.put(key, newNode);
this.addNode(newNode);
++count;
if (count > capacity) {
// pop the tail
DLinkedNode tail = this.popTail();
this.cache.remove(tail.key);
--count;
}
} else {
// update the value.
node.value = value;
this.moveToHead(node);
}
}
}
/**
* 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);
*/