面试官会让你手写LRU缓存淘汰策略吗

最新推荐文章于 2023-12-27 10:50:27 发布

hurusea

最新推荐文章于 2023-12-27 10:50:27 发布

阅读量170

点赞数

分类专栏： LeetCode刷题

本文链接：https://blog.csdn.net/qq_43294955/article/details/114502870

版权

LeetCode刷题专栏收录该内容

19 篇文章 0 订阅

订阅专栏

该博客介绍了两种使用Java实现LRU（Least Recently Used）缓存淘汰策略的方法。第一种是通过自定义数据结构，利用HashMap和双向链表；第二种是继承LinkedHashMap并重写removeEldestEntry方法。此外，还提供了一个简化版的LRU缓存解决方案，用于处理给定操作序列。

摘要由CSDN通过智能技术生成

import java.util.HashMap;
import java.util.Map;

public class LRUCache {
    class Node {
        int key;
        int value;
        Node prev;
        Node next;

        public Node() {
        }

        public Node(int key, int value) {
            this.key = key;
            this.value = value;
        }
    }

    private Map<Integer, Node> cache = new HashMap<Integer, Node>();
    private int size;
    private int capacity;
    private Node head, tail;

    public LRUCache(int capacity) {
        this.size = 0;
        this.capacity = capacity;
        head = new Node();
        tail = new Node();
        head.next = tail;
        tail.prev = head;
    }

    public int get(int key) {
        Node node = cache.get(key);
        if (node == null) {
            return -1;
        }
        moveToHead(node);
        return node.value;
    }

    public void put(int key, int value) {
        Node node = cache.get(key);
        if (node == null) {
            Node newNode = new Node(key, value);
            cache.put(key, newNode);
            addToHead(newNode);
            ++size;
            if (size > capacity) {
                Node tail = removeTail();
                cache.remove(tail.key);
                --size;
            }
        } else {
            node.value = value;
            moveToHead(node);
        }
    }

    private void addToHead(Node node) {
        node.prev = head;
        node.next = head.next;
        head.next.prev = node;
        head.next = node;
    }

    private void removeNode(Node node) {
        node.prev.next = node.next;
        node.next.prev = node.prev;
    }

    private void moveToHead(Node node) {
        removeNode(node);
        addToHead(node);
    }

    private Node removeTail() {
        Node res = tail.prev;
        removeNode(res);
        return res;
    }
}

取巧的做法1

class LRUCache extends LinkedHashMap<Integer, Integer>{
    private int capacity;
    
    public LRUCache(int capacity) {
        super(capacity, 0.75F, true);
        this.capacity = capacity;
    }

    public int get(int key) {
        return super.getOrDefault(key, -1);
    }

    public void put(int key, int value) {
        super.put(key, value);
    }

    @Override
    protected boolean removeEldestEntry(Map.Entry<Integer, Integer> eldest) {
        return size() > capacity; 
    }
}

取巧的做法2


import java.util.*;

public class LRUCache<k, v> extends LinkedHashMap<k, v> {
    private static final int MAX_ENTRIES = 3;

    protected boolean removeEldestEntry(Map.Entry eldest) {
        return size() > MAX_ENTRIES;
    }

    LRUCache() {
        super(MAX_ENTRIES, 0.75f, true);
    }

    public static void main(String[] args) {
        LRUCache<Integer, String> cache = new LRUCache<>();
        cache.put(1, "a");
        cache.put(2, "b");
        cache.put(3, "c");
        cache.get(1);
        cache.put(4, "d");
        System.out.println(cache.keySet());
    }

}

取巧+牛客版

public static int[] LRU(int[][] operators, int k) {
        List<Integer> res = new ArrayList<>();
        map = new LinkedHashMap<Integer, Integer>((int)Math.ceil(k/0.75f)+1,0.75f,true) {
            @Override
            protected boolean removeEldestEntry(Map.Entry<Integer, Integer> eldest) {
                return size() > k;
            }
        };
        for (int i = 0; i < operators.length; i++) {
            if (operators[i].length == 3)
                map.put(operators[i][1], operators[i][2]);
            else if (operators[i].length == 2)
                res.add(map.getOrDefault(operators[i][1],-1));
        }
        if (res.size() == 0)
            return new int[0];
        int[] resInt = new int[res.size()];
        for (int i = 0; i < res.size(); i++)
            resInt[i] = res.get(i);
        return resInt;
    }