146. LRU Cache

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.

get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
put(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.

Follow up:
Could you do both operations in O(1) time complexity?

Example:

LRUCache cache = new LRUCache( 2 /* capacity */ );

cache.put(1, 1);
cache.put(2, 2);
cache.get(1);       // returns 1
cache.put(3, 3);    // evicts key 2
cache.get(2);       // returns -1 (not found)
cache.put(4, 4);    // evicts key 1
cache.get(1);       // returns -1 (not found)
cache.get(3);       // returns 3
cache.get(4);       // returns 4

思路：要使操作O(1)，因此用HashMap查找，双向链表执行增删操作，从头部加，从末尾删，为了编程便利，增加两个冗余节点辅助，count记录个数

class Node{
    public int key;//一定要加，因为在删除时要知道node的key,从map中删掉
    public int value;
    public Node pre;
    public Node next;
    public Node(int key,int value){
        this.key = key;
        this.value = value;
    }
}
class LRUCache {
    private int cap;
    private int count;
    private Map<Integer,Node> map;
    private Node head;
    private Node tail;

    public LRUCache(int capacity) {
        cap = capacity;
        count = 0;
        map = new HashMap<>();
        head = new Node(0,0);
        tail = new Node(0,0);
        head.next = tail;
        tail.pre = head;
    }
    
    public void addToHead(Node node){
        node.next = head.next;
        node.next.pre = node;
        head.next = node;
        node.pre = head;
    }
    public void remove(Node node){
        node.pre.next = node.next;
        node.next.pre = node.pre;
    }
    public int get(int key) {
        if(map.get(key)!=null){
            Node node = map.get(key);
            remove(node);
            addToHead(node);
            return node.value;
        }
        return -1;
    }
    
    public void put(int key, int value) {
        if(map.get(key)!=null){//修改其值，加到头部
            Node node = map.get(key);
            remove(node);
            node.value = value;
            addToHead(node);
        }
        else{
            if(count<cap){
                count++;
            }
            else{
                Node temp = tail.pre;
                remove(temp);
                map.remove(temp.key);
            }
            Node node = new Node(key,value);
            map.put(key,node);
            addToHead(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);
 */