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.

The cache is initialized with a positive capacity.

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

1. 双向链表(Node) + hashmap<key, Node>

class LRUCache {
    Node head;
    Node tail;
    int cap;
    int size;
    Map<Integer, Node> map;
    public LRUCache(int capacity) {
        head = new Node(-1, -1);
        tail = new Node(-1, -1);
        head.next = tail;
        tail.pre = head;
        cap = capacity;
        size = 0;
        map = new HashMap<>();
    }
    
    public int get(int key) {
        if (!map.containsKey(key)) return -1;
        Node n = map.get(key);
        if (n.next != tail) {
            remove(n.pre);
            add(n);
        }
        return n.value;
    }
    
    public void put(int key, int value) {
        Node n = new Node(key, value);
        if (!map.containsKey(key)) {
            if (size == cap) {
                map.remove(head.next.key);
                remove(head);
            } else size++;
        } else {
            Node old = map.get(key);
            remove(old.pre);
        }
        map.put(key, n);
        add(n);
    }
    
    public void remove(Node n) {
        n.next.next.pre = n;
        n.next = n.next.next;
    }
    
    public void add(Node n) {
        Node pre = tail.pre;
        pre.next = n;
        n.next = tail;
        tail.pre = n;
        n.pre = pre;
    }
    
    class Node{
        Node pre;
        Node next;
        int key;
        int value;
        public Node(int key, int value) {
            this.key = key;
            this.value = value;
        }
    }
}

2. linkedhashmap

class LRUCache {
    private int cap;
    private Map<Integer, Integer> map;
    public LRUCache(int capacity) {
        this.cap = capacity;
        map = new LinkedHashMap<>();
    }
    
    public int get(int key) {
        int res = -1;
        if (map.containsKey(key)) {
            res = map.get(key);
            map.remove(key);
            map.put(key, res);
        }
        return res;
    }
    
    public void put(int key, int value) {
        if (map.containsKey(key)) {
            map.remove(key);
        }
        if (map.size() == cap) {
            for (Integer i : map.keySet()) {
                map.remove(i);
                break;
            }
        }
        map.put(key, value);
    }
}