LRU缓存，leetcode习题

LRU缓存

public class LRUCache {
    class DLinkedNode {
        int key;
        int value;
        DLinkedNode prev;
        DLinkedNode next;
        public DLinkedNode() {}
        public DLinkedNode(int _key, int _value) {key = _key; value = _value;}
    }//自定义双链表

    private Map<Integer,DLinkedNode> map = new HashMap<>();
    private int size;
    private int capacity;
    private DLinkedNode head,tail;

    public LRUCache(int capacity) {
        this.size = 0;
        this.capacity = 2;
        head = new DLinkedNode();
        tail = new DLinkedNode();//虚节点
        head.next = tail;
        tail.next = head;
    }

    public int get(int key) {
        DLinkedNode node = map.get(key);
        if (node == null){
            return -1;
        }
        moveToHead(node);//将命中的缓存节点，移到头部

        return node.value;
    }

    public void put (int key,int value){
        DLinkedNode node = map.get(key);//判断节点
        if (node == null){
            //创建一个节点
            DLinkedNode newNode = new DLinkedNode(key,value);
            map.put(key,newNode);
            addToHead(newNode);
            ++size;
            if (size>capacity){
                DLinkedNode res = removeTail();//删掉尾节点
                map.remove(res.key);
                size--;

            }else {
                //更新值
              node.value = value;
                moveToHead(node);
            }

        }

    }

    private void addToHead(DLinkedNode node) {
        node.prev = head;
        node.next = head.next;
        head.next.prev = node;
        head.next = node;

    }

    private void removeNode(DLinkedNode node) {

        node.prev.next = node.next;//删除此节点
        node.prev.next = node.prev;

    }

    private void moveToHead(DLinkedNode node) {
        removeNode(node);//将此节点断掉
        addToHead(node);//将此节点添加到头节点
    }

    private DLinkedNode removeTail() {
        //去掉尾部节点
        DLinkedNode res = tail.prev;//确定尾节点
        removeNode(res);
        return res;
    }

}