refactor 133

fishercoder1534 · fishercoder1534 · commit 73e79a8cf028 · 2018-04-22T16:27:40.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_133.java b/src/main/java/com/fishercoder/solutions/_133.java
@@ -8,7 +8,10 @@
 import java.util.Queue;
 
 /**
- * Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.
+ * 133. Clone Graph
+
+ Clone an undirected graph.
+ Each node in the graph contains a label and a list of its neighbors.
 
 
  OJ's undirected graph serialization:
@@ -34,28 +37,29 @@
  */
 public class _133 {
 
+  public static class Solution1 {
     public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
-        if (node == null) {
-            return node;
-        }
+      if (node == null) {
+        return node;
+      }
 
-        Map<Integer, UndirectedGraphNode> map = new HashMap();
-        Queue<UndirectedGraphNode> queue = new LinkedList();
-        UndirectedGraphNode root = new UndirectedGraphNode(node.label);
-        map.put(root.label, root);
-        queue.offer(node);
-        //remember to offer the original input node into the queue which contains all the information
-        while (!queue.isEmpty()) {
-            UndirectedGraphNode curr = queue.poll();
-            for (UndirectedGraphNode eachNode : curr.neighbors) {
-                if (!map.containsKey(eachNode.label)) {
-                    map.put(eachNode.label, new UndirectedGraphNode(eachNode.label));
-                    queue.offer(eachNode);
-                }
-                map.get(curr.label).neighbors.add(map.get(eachNode.label));
-            }
+      Map<Integer, UndirectedGraphNode> map = new HashMap();
+      Queue<UndirectedGraphNode> queue = new LinkedList();
+      UndirectedGraphNode root = new UndirectedGraphNode(node.label);
+      map.put(root.label, root);
+      queue.offer(node);
+      //remember to offer the original input node into the queue which contains all the information
+      while (!queue.isEmpty()) {
+        UndirectedGraphNode curr = queue.poll();
+        for (UndirectedGraphNode eachNode : curr.neighbors) {
+          if (!map.containsKey(eachNode.label)) {
+            map.put(eachNode.label, new UndirectedGraphNode(eachNode.label));
+            queue.offer(eachNode);
+          }
+          map.get(curr.label).neighbors.add(map.get(eachNode.label));
         }
-        return root;
+      }
+      return root;
     }
-
+  }
 }
diff --git a/src/test/java/com/fishercoder/_133Test.java b/src/test/java/com/fishercoder/_133Test.java
@@ -8,36 +8,33 @@
 
 import static junit.framework.Assert.assertEquals;
 
-/**
- * Created by fishercoder on 1/15/17.
- */
 public class _133Test {
-    private static _133 test;
-    private static UndirectedGraphNode expected;
-    private static UndirectedGraphNode actual;
+  private static _133.Solution1 solution1;
+  private static UndirectedGraphNode expected;
+  private static UndirectedGraphNode actual;
 
-    @BeforeClass
-    public static void setup() {
-        test = new _133();
-    }
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _133.Solution1();
+  }
 
-    @Before
-    public void setupForEachTest() {
-        expected = null;
-        actual = null;
-    }
+  @Before
+  public void setupForEachTest() {
+    expected = null;
+    actual = null;
+  }
 
-    @Test
-    public void test1() {
-        UndirectedGraphNode node0 = new UndirectedGraphNode(0);
-        UndirectedGraphNode node1 = new UndirectedGraphNode(1);
-        UndirectedGraphNode node2 = new UndirectedGraphNode(2);
-        node0.neighbors.add(node1);
-        node0.neighbors.add(node2);
-        node1.neighbors.add(node2);
+  @Test
+  public void test1() {
+    UndirectedGraphNode node0 = new UndirectedGraphNode(0);
+    UndirectedGraphNode node1 = new UndirectedGraphNode(1);
+    UndirectedGraphNode node2 = new UndirectedGraphNode(2);
+    node0.neighbors.add(node1);
+    node0.neighbors.add(node2);
+    node1.neighbors.add(node2);
 
-        expected = node0;
-        actual = test.cloneGraph(expected);
-        assertEquals(expected, actual);
-    }
+    expected = node0;
+    actual = solution1.cloneGraph(expected);
+    assertEquals(expected, actual);
+  }
 }
