优点知识阳明 Kubernetes开发
class Counter {
HashMap<Integer, Integer> cache = new HashMap<>();
public int fibonacci(int n) {
if (n == 0 || n == 1) {
return 1;
}
return fibonacci(n - 1) + fibonacci(n - 2);
}
public int fibonacci4Cache(int n) {
if (cache.containsKey(n)) {
// 缓存命中 cache hit
return cache.get(n);
}
