refactor 460

fishercoder1534 · fishercoder1534 · commit 8307b4af51e3 · 2020-04-06T07:21:22.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_460.java b/src/main/java/com/fishercoder/solutions/_460.java
@@ -3,10 +3,11 @@
 import java.util.HashMap;
 import java.util.LinkedHashSet;
 
-/**460. LFU Cache
+/**
+ 460. LFU Cache
 
- * Design and implement a data structure for Least Frequently Used (LFU) cache.
- * It should support the following operations: get and put.
+ Design and implement a data structure for Least Frequently Used (LFU) cache.
+ It should support the following operations: get and put.
 
  get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
  put(key, value) - Set or insert the value if the key is not already present. When the cache reaches its capacity,
