LeetCode题解（Java）：146-LRU缓存机制

146. LRU缓存机制

https://leetcode-cn.com/problems/lru-cache/

1 - 基于 LinkedHashMap 实现

class LRUCache {
   
    private Cache<Integer, Integer> cache;
    private int maxCapacity;
    
    public LRUCache(int capacity) {
   
        cache = new Cache<>(capacity);
    }
    
    static class Cache<K, V> extends LinkedHashMap<K, V> {
   
        private static final long serialVersionUID = -1173181165859044409L;
        private final int maxCapacity;
        public Cache(int capacity) {
   
            super(capacity, 1f, true);
            this.maxCapacity = capacity;
        }
        @Override
        protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
   
            return this.size() > maxCapacity;
        }
    }
    
    public int get(