LeetCode 146 LRU Cache (双向链表 map)

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

题目链接：https://leetcode.com/problems/lru-cache/

题目分析：LRU Cache，题目需要支持高效的插入删除，容易想到用双向链表，还需要一个map用来根据key获取链表结点，本题主要考察的是代码能力

时间击败77.45%，空间击败100%

class LRUCache {
    
    public class DoublyListNode {
        int key;
        int value;
        DoublyListNode prev;
        DoublyListNode next;

        DoublyListNode(int key, int value) {
            this.key = key;
            this.value = value;
        }
    }
    
    public int maxCapacity;
    public int curCapacity;
    public HashMap<Integer, DoublyListNode> nodeMap;
    DoublyListNode head;
    DoublyListNode tail;

    public LRUCache(int capacity) {
        this.maxCapacity = capacity;
        this.nodeMap = new HashMap<>();
    }
    
    public int get(int key) {
        if (!nodeMap.containsKey(key)) {
            return -1;
        }

        setHead(nodeMap.get(key));
        //System.out.println("get head key = " + this.head.key + " tail key = " + this.tail.key);
        return nodeMap.get(key).value;      
    }
    
    public void put(int key, int value) {
        if (!nodeMap.containsKey(key)) {
            DoublyListNode node = new DoublyListNode(key, value);
            nodeMap.put(key, node);
            insert(node);
            setHead(node);
            this.curCapacity++;
            if (this.curCapacity > this.maxCapacity) {
                deleteTail();
            }
        } else {
            nodeMap.get(key).value = value;
            setHead(nodeMap.get(key));
        }

        //System.out.println("put head key = " + this.head.key + " tail key = " + this.tail.key);
    }
    
    public void insert(DoublyListNode node) {
        if (this.tail == null) {
            this.tail = node;
            return;
        }
        
        node.prev = this.tail;
        node.next = null;
        this.tail.next = node;
        this.tail = node;
    }
    
    public void deleteTail() {
        nodeMap.remove(this.tail.key);
        this.tail.prev.next = null;
        this.tail = this.tail.prev;
    }
    
    public void setHead(DoublyListNode node) {
        if (this.head == null) {
            this.head = node;
            return;
        }
        
        if (node == this.head) {
            return;
        } else if (node == this.tail) {
            this.tail.prev.next = null;
            this.tail = this.tail.prev;
        } else {
            node.prev.next = node.next;
            node.next.prev = node.prev;
        }
        
        node.prev = null;
        node.next = this.head;
        this.head.prev = node;
        this.head = 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);
 */