LRU最少使用

import java.util.LinkedHashMap;
import java.util.Map;

public class LRUCache<K, V> extends LinkedHashMap<K, V> {

    private int size;

    public LRUCache(int size) {
        super((int) Math.ceil(size / 0.75) + 1, 0.75f, true);
        this.size = size;
    }

    protected boolean removeEldestEntry(Map<K, V> eldest) {
        return size() > size;
    }
}