LintCode 134: LRU Cache (经典题)

134. LRU Cache
     中文English
     Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.

get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
set(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. Finally, you need to return the data from each get

Example
Example1

Input:
LRUCache(2)
set(2, 1)
set(1, 1)
get(2)
set(4, 1)
get(1)
get(2)
Output: [1,-1,1]
Explanation：
cache cap is 2，set(2,1)，set(1, 1)，get(2) and return 1，set(4,1) and delete (1,1)，because （1,1）is the least use，get(1) and return -1，get(2) and return 1.
Example 2:

Input：
LRUCache(1)
set(2, 1)
get(2)
set(3, 2)
get(2)
get(3)
Output：[1,-1,2]
Explanation：
cache cap is 1，set(2,1)，get(2) and return 1，set(3,2) and delete (2,1)，get(2) and return -1，get(3) and return 2.

解法1：

数据结构采用doubly linked list和hashmap。记得Node里面必须要加key这个字段，因为在删除元素(当capacity达到上限时)会用到mp.erase(head->next->key)。
注意LRUCache初始化时必须加上head和tail两个dummy node。
代码如下：

class Node {
public:
    Node *prev;
    Node *next;
    int key;
    int val;
    Node(int k = 0, int v = 0) : key(k), val(v), prev(NULL), next(NULL) {}
};

class LRUCache {
public:
    /*
    * @param capacity: An integer
    */
    LRUCache(int capacity) {
        this->capacity = capacity;
        this->head = new Node;  //dummy node
        this->tail = new Node;  //dummy node
        head->next = tail;
        tail->prev = head;
    }

    /*
     * @param key: An integer
     * @return: An integer
     */
    int get(int key) {
        if (mp.find(key) == mp.end()) return -1;
        Node *findNode = mp[key];
      //  findNode->prev->next = findNode->next;
      //    findNode->next->prev = findNode->prev;
        moveToTail(findNode);
        return findNode->val;
    }

    /*
     * @param key: An integer
     * @param value: An integer
     * @return: nothing
     */
    void set(int key, int value) {
        if (mp.find(key) != mp.end()) {
            mp[key]->val = value;
            moveToTail(mp[key]);
            return;
        } else if (mp.size() == capacity) { //LRU full, remove the least used node
            mp.erase(head->next->key);

            head->next = head->next->next;
            head->next->prev = head;
        }
        
        Node * node = new Node(key, value);
        mp[key] = node;
        moveToTail(node);
    }
    
private:
   Node *head, *tail;
   int capacity;
   map<int, Node *> mp;
   
   void moveToTail(Node * node) {
       if (node->prev) node->prev->next = node->next;
       if (node->next) node->next->prev = node->prev;
       
       node->prev = tail->prev;
       tail->prev->next = node;
       tail->prev = node;
       node->next = tail;
   }
};

代码同步在
https://github.com/luqian2017/Algorithm

二刷:

struct Node {
    int key;
    int val;
    Node *prev;
    Node *next;
    Node(int k, int v) : key(k), val(v), prev(nullptr), next(nullptr) {}
};

class LRUCache {
public:
    /*
    * @param capacity: An integer
    */
    LRUCache(int capacity) {
        cap = capacity;
        dummyHead = new Node(0, 0);
        dummyTail = new Node(0, 0);
        dummyHead->next = dummyTail;
        dummyTail->prev = dummyHead;
    }

    /*
     * @param key: An integer
     * @return: An integer
     */
    int get(int key) {
        if (keyMap.find(key) == keyMap.end()) {
            return -1;
        }
        move2Tail(key);
        return keyMap[key]->val;
    }

    /*
     * @param key: An integer
     * @param value: An integer
     * @return: nothing
     */
    void set(int key, int value) {
         if (keyMap.find(key) == keyMap.end()) {
            if (keyMap.size() == cap) {
                //delete least recently used
                keyMap.erase(dummyHead->next->key);
                dummyHead->next->next->prev = dummyHead;
                dummyHead->next = dummyHead->next->next;
            }
            keyMap[key] = new Node(key, value);
        } else {
            keyMap[key]->val = value;
        }
        move2Tail(key);
    }

private:
    int cap;
    unordered_map<int, Node *> keyMap; //<key, Node *>
    Node *dummyHead, *dummyTail;
    //head: least recently used 
    //tail: most recently used
    void move2Tail(int key) {
        Node *node = keyMap[key];
        //delete the key in doubly linked list
        if (node->prev != nullptr || node->next != nullptr) { //it is not a brand new node
           node->prev->next = node->next;
           node->next->prev = node->prev;
        }
           
        //insert to tail
        dummyTail->prev->next = node;
        node->prev = dummyTail->prev;
        node->next = dummyTail;
        dummyTail->prev = node;
    }

};

三刷:

struct Node {
    int key;
    int val;
    Node *prev, *next;
    Node(int k, int v) : key(k), val(v), prev(NULL), next(NULL) {}
};

class LRUCache {
public:
    LRUCache(int capacity) {
        front = new Node(-1, 0);
        tail = new Node(-1, 0);
        front->next = tail;
        tail->prev = front;
        cap = capacity;
    }
    
    int get(int key) {
        if (mp.find(key) == mp.end()) return -1;
        move2Tail(mp[key]);
        return mp[key]->val;
    }
    
    void put(int key, int value) {
        if (mp.find(key) != mp.end()) {
            mp[key]->val = value;
        } else {
            if (mp.size() == cap) {
                Node *tmp = front->next;
                front->next = tmp->next;
                front->next->prev = front;
                mp.erase(tmp->key);
                delete tmp;
            }
            Node *newNode = new Node(key, value);
            mp[key] = newNode;
        }        
        move2Tail(mp[key]);  
    }
private:
    map<int, Node *> mp; //<key, Node *>
    Node *front, *tail;
    int cap = 0;
    void move2Tail(Node * node) {
        Node *tailPrev = tail->prev;
        if (node != tailPrev) {
            if (node->prev) {
                Node *nodePrev = node->prev;
                nodePrev->next = node->next;
                node->next->prev = nodePrev;
            }
            tailPrev->next = node;
            node->prev = tailPrev;
            node->next = tail;
            tail->prev = node;
        }
    }
};

/**
 * Your LRUCache object will be instantiated and called as such:
 * LRUCache* obj = new LRUCache(capacity);
 * int param_1 = obj->get(key);
 * obj->put(key,value);
 */