refactor 138

fishercoder1534 · fishercoder1534 · commit 9fb6b3828edc · 2018-04-27T07:37:27.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_138.java b/src/main/java/com/fishercoder/solutions/_138.java
@@ -3,46 +3,48 @@
 import java.util.HashMap;
 import java.util.Map;
 
-/**138. Copy List with Random Pointer
+/**
+ * 138. Copy List with Random Pointer
  *
  * A linked list is given such that each node contains an additional random
  * pointer which could point to any node in the list or null.
  * Return a deep copy of the list.
  * */
 
 public class _138 {
-
+  public static class Solution1 {
     public RandomListNode copyRandomList(RandomListNode head) {
-        /**Key is the original nodes, value is the new nodes we're deep copying to.*/
-        Map<RandomListNode, RandomListNode> map = new HashMap();
-        RandomListNode node = head;
-
-        //loop for the first time: copy the node themselves with only labels
-        while (node != null) {
-            map.put(node, new RandomListNode(node.label));
-            node = node.next;
-        }
-
-        //loop for the second time: copy random and next pointers
-        node = head;
-        while (node != null) {
-            map.get(node).next = map.get(node.next);
-            map.get(node).random = map.get(node.random);
-            node = node.next;
-        }
-
-        return map.get(head);
+      /**Key is the original nodes, value is the new nodes we're deep copying to.*/
+      Map<RandomListNode, RandomListNode> map = new HashMap();
+      RandomListNode node = head;
+
+      //loop for the first time: copy the node themselves with only labels
+      while (node != null) {
+        map.put(node, new RandomListNode(node.label));
+        node = node.next;
+      }
+
+      //loop for the second time: copy random and next pointers
+      node = head;
+      while (node != null) {
+        map.get(node).next = map.get(node.next);
+        map.get(node).random = map.get(node.random);
+        node = node.next;
+      }
+
+      return map.get(head);
     }
 
     // Definition for singly-linked list with a random pointer.
     class RandomListNode {
-        int label;
+      int label;
 
-        RandomListNode next;
-        RandomListNode random;
+      RandomListNode next;
+      RandomListNode random;
 
-        RandomListNode(int x) {
-            this.label = x;
-        }
+      RandomListNode(int x) {
+        this.label = x;
+      }
     }
+  }
 }
