在java中实现策略模式的条件[关闭]

Question

我的任务是使用策略模式（LFU、LRU和2Q）编写3个缓存实现
在这一点上，我已经编写了LRU实现，无法考虑实现它的条件。

这是我的密码：

import java.util.Map;

@FunctionalInterface
public interface Cache{
    Map<Character,Integer> caching(String key);

import java.util.*;

public class LRUCache implements Cache {
    private final Map<Character, Integer> value;
    private final int capacity;

    public LRUCache(int capacity, Map<Character, Integer> value) {
        this.value = value;
        this.capacity = capacity;
    }

    @Override
    public Map<Character, Integer> caching(String key) {
        Map<String, Map<Character, Integer>> cache
                = new LinkedHashMap<>(capacity, 1.0f, true) {
            protected boolean removeEldestEntry(Map.Entry eldest) {
                return size() > capacity;
            }
        };
        cache.put(key, value);
        return cache.get(key);
    }
}

import java.util.*;

public class CharCounter {
    public Map<Character, Integer> charCounter(String arg) {
        LinkedHashMap<Character, Integer> elements = new LinkedHashMap<>();
        List<Character> chars = new ArrayList<>();
        Cache cache = new LRUCache(100,elements);
        if (/*I can't think of what to write here*/) {
            System.out.println("not cache");
            for (char c : arg.toCharArray()) {
                chars.add(c);
            }
            for (Character element : chars) {
                if (elements.containsKey(element)) {
                    elements.put(element, elements.get(element) + 1);
                } else {
                    elements.put(element, 1);
                }
            }
        }
        return cache.caching(arg);
    }
}

Answer 1

您可以最初添加一个计数器来跟踪数据结构中的索引递增，然后如果计数器递增1，您可以将其应用于循环