146. LRU Cache

https://leetcode.com/problems/lru-cache/description/

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

from collections import deque
class Node(object):
    def __init__(self, key, val):
        self.val = val
        self.key = key
        
class LRUCache(object):

    def __init__(self, capacity):
        """
        :type capacity: int
        """
        self.queue = deque([])
        self.map = {}
        self.cap = capacity
        
    def get(self, key):
        """
        :type key: int
        :rtype: int
        """
        if key not in self.map:
            return -1
        res = self.map[key]
        self.queue.remove(res)
        self.queue.appendleft(res)
        return res.val
        

    def put(self, key, value):
        """
        :type key: int
        :type value: int
        :rtype: void
        """
        if key not in self.map:
            node = Node(key, value)
            if len(self.map) >= self.cap:
                evict = self.queue.pop()
                self.map.pop(evict.key, None)
            self.map[key] = node
            self.queue.appendleft(node)
        else:
            self.map[key].val = value
            self.queue.remove(self.map[key])
            self.queue.appendleft(self.map[key])