MCPcopy Index your code
hub / github.com/neetcode-gh/leetcode / put

Method put

java/0460-lfu-cache.java:30–45  ·  view source on GitHub ↗
(int key, int value)

Source from the content-addressed store, hash-verified

28 }
29
30 public void put(int key, int value) {
31 if (capacity == 0) return;
32 if (entries.containsKey(key)) {
33 Entry e = entries.get(key);
34 e.value = value;
35 updateFrequency(e);
36 } else {
37 if (entries.size() == capacity) {
38 evictLeastFrequent();
39 }
40 Entry e = new Entry(key, value, 1);
41 entries.put(key, e);
42 freqMap.computeIfAbsent(1, k -> new LinkedHashSet<>()).add(e);
43 minFreq = 1; // Reset min frequency to 1 for new entry
44 }
45 }
46
47 private void updateFrequency(Entry e) {
48 int oldFreq = e.freq;

Callers 15

deleteAndEarnMethod · 0.45
isValidMethod · 0.45
checkSubarraySumMethod · 0.45
dfsMethod · 0.45
dfsMethod · 0.45
setMethod · 0.45
dfsMethod · 0.45
new21GameMethod · 0.45
findOrderMethod · 0.45
findModeMethod · 0.45
minDeletionsMethod · 0.45
dfsMethod · 0.45

Calls 5

updateFrequencyMethod · 0.95
evictLeastFrequentMethod · 0.95
getMethod · 0.45
sizeMethod · 0.45
addMethod · 0.45

Tested by 1