Method get

java/Linked Lists/LRUCache.java:32–43

(int key)

    }

    public int get(int key) {
        if (!cache.containsKey(key)) {
            return -1;
        }
        else {
            // To make this key the most recently used, remove its node and
            // re-add it to the tail of the linked list.
            remove(cache.get(key));
            addToTail(cache.get(key));
            return cache.get(key).val;
        }
    }

    public void put(int key, int val) {
        // If a node with this key already exists, remove it from the