edit 146

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_146.java

@@ -104,7 +104,15 @@ public int get(int key) {
             if (node == null) {
                 return -1;
             } else {
-                update(node);
+
+                /**Do two operations: this makes the process more clear:
+                 * remove the old node first, and then
+                 * just add the node again.
+                 * This will guarantee that this node will be at the latest position:
+                 * the most recently used position.*/
+                remove(node);
+                add(node);
+
                 return node.value;
             }
         }
@@ -133,14 +141,6 @@ public void set(int key, int value) {
             }
         }
 
-        private void update(DoublyLinkedListPlusHashMapSolution.Node node) {
-            /** this simplifies the process, just do two operations, remove the old node first, and then
-             just add the node again this will guarantee that this node will be at the latest position:
-             the most recently used position.*/
-            remove(node);
-            add(node);
-        }
-
         private void remove(DoublyLinkedListPlusHashMapSolution.Node node) {
             DoublyLinkedListPlusHashMapSolution.Node next = node.next, prev = node.prev;
             prev.next = next;