update 146

fishercoder1534 · fishercoder1534 · commit 259e02994726 · 2024-01-26T16:38:02.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_146.java b/src/main/java/com/fishercoder/solutions/_146.java
@@ -6,30 +6,30 @@
 
 /**
  * 146. LRU Cache
- *
+ * <p>
  * Design and implement a data structure for Least Recently Used (LRU) 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 reached its capacity, it should invalidate the least recently used item before inserting a new item.
-
- Follow up:
- Could you do both operations in O(1) time complexity?
-
- Example:
-
- LRUCache cache = new LRUCache(2);//capacity
-
-        cache.put(1, 1);
-        cache.put(2, 2);
-        cache.get(1);       // returns 1
-        cache.put(3, 3);    // evicts key 2
-        cache.get(2);       // returns -1 (not found)
-        cache.put(4, 4);    // evicts key 1
-        cache.get(1);       // returns -1 (not found)
-        cache.get(3);       // returns 3
-        cache.get(4);       // returns 4
-        */
+ * <p>
+ * 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 reached its capacity, it should invalidate the least recently used item before inserting a new item.
+ * <p>
+ * Follow up:
+ * Could you do both operations in O(1) time complexity?
+ * <p>
+ * Example:
+ * <p>
+ * LRUCache cache = new LRUCache(2);//capacity
+ * <p>
+ * cache.put(1, 1);
+ * cache.put(2, 2);
+ * cache.get(1);       // returns 1
+ * cache.put(3, 3);    // evicts key 2
+ * cache.get(2);       // returns -1 (not found)
+ * cache.put(4, 4);    // evicts key 1
+ * cache.get(1);       // returns -1 (not found)
+ * cache.get(3);       // returns 3
+ * cache.get(4);       // returns 4
+ */
 
 public class _146 {
 
@@ -70,7 +70,7 @@ public void put(int key, int value) {
     public class Solution2 {
         public class LRUCache {
             /**
-             * The more verbose solution is to write a doubly linked list plus a map.
+             * The more verbose solution is to implement a doubly linked list yourself plus a map, i.e. LinkedHashMap.
              */
             private class Node {
                 int key;
