算法第十周作业01

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

Solution

• 采用Hash结构存储Cache的KV
• 采用链表来存储LRU有序序列
• 每次put(key)和get(key)操作将key放到链表尾部（最近使用）
• 如果put(key)操作导致LRU队列满了，那么删除链表头部元素（最近最少使用）

Code

import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;

public class LRUCache {
    // 采用Hash搜索key对应的value
    private Map<Integer, Integer> map;
    // 采用链表保存LRU的顺序
    private List<Integer> list;
    // 定义LRU和Hash的容量
    private int capacity;
    // 构造缓存器
    public LRUCache(int capacity) {
        this.capacity = capacity;
        map = new HashMap<Integer, Integer>();
        list = new LinkedList<Integer>();
    }

    // Get操作
    public int get(int key) {
        Integer result = map.get(key);
        if(result == null){
            // 如果Hash（缓存）中不存在key
            result = -1;
        } else {
            // 如果Hash（缓存）中存在key，那么更新LRU的顺序
            list.remove(((Integer)key));
            list.add(key);
        }
        // 返回缓存结果
        return result;
    }

    public void put(int key, int value) {
        if(map.containsKey(key)){
            // 如果Hash（缓存）中存在key，那么更新相应的value并更新LRU顺序，LRU容器不会溢出
            map.put(key, value);
            list.remove(((Integer)key));
            list.add(key);
        } else if(list.size() == capacity){
            // 如果Hash（缓存）中不存在key，而且LRU容器满了，则移除LRU的第一个元素，并添加新元素，在Hash中插入KV
            Integer remove = list.remove(0);
            list.add(key);
            map.remove(remove);
            map.put(key, value);
        } else {
            // 如果LRU容器未满，则直接在Hash和LRU队列中插入新元素
            list.add(key);
            map.put(key, value);
        }
    }

    // 测试案例
    public static void main(String[] args) {
        LRUCache cache = new LRUCache(2);
        cache.put(1, 1);
        cache.put(2, 2);
        System.out.println(cache.get(1));       // returns 1
        cache.put(3, 3);    // evicts key 2
        System.out.println(cache.get(2));       // returns -1 (not found)
        cache.put(4, 4);    // evicts key 1
        System.out.println(cache.get(1));       // returns -1 (not found)
        System.out.println(cache.get(3));       // returns 3
        System.out.println(cache.get(4));       // returns 4
    }
}