Method get

cpp/Linked Lists/lru_cache.cpp:43–52

    }

    int get(int key) {
        if (hashmap.find(key) == hashmap.end()) {
            return -1;
        }
        // To make this key the most recently used, remove its node and 
        // re-add it to the tail of the linked list. 
        removeNode(hashmap[key]);
        addToTail(hashmap[key]);
        return hashmap[key]->val;
    }

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