8000 refactor 460 · jaamit/Leetcode@8307b4a · GitHub
[go: up one dir, main page]
Skip to content

Commit 8307b4a

Browse files
fishercoder1534fishercoder1534
committed
refactor 460
1 parent bf796be commit 8307b4a

File tree

1 file changed

+4
-3
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+4
-3
lines changed

‎src/main/java/com/fishercoder/solutions/_460.java

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -3,10 +3,11 @@
33
import java.util.HashMap;
44
import java.util.LinkedHashSet;
55

6-
/**460. LFU Cache
6+
/**
7+
460. LFU Cache
78
8-
* Design and implement a data structure for Least Frequently Used (LFU) cache.
9-
* It should support the following operations: get and put.
9+
Design and implement a data structure for Least Frequently Used (LFU) cache.
10+
It should support the following operations: get and put.
1011
1112
get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
1213
put(key, value) - Set or insert the value if the key is not already present. When the cache reaches its capacity,

0 commit comments

Comments
 (0)
0