Method LRUCache

cpp/Linked Lists/lru_cache.cpp:22–27

    DoublyLinkedListNode* head;
    DoublyLinkedListNode* tail;
    LRUCache(int capacity) : capacity(capacity) {
        head = new DoublyLinkedListNode(-1, -1);
        tail = new DoublyLinkedListNode(-1, -1);
        head->next = tail;
        tail->prev = head;
    }
    // Destructor: Cleans up dynamically allocated resources 
    // to prevent memory leaks. Implemented if time permits 
    // during an interview.