refactor 133

fishercoder1534 · fishercoder1534 · commit f894fff7e481 · 2020-10-20T06:42:33.000-07:00
diff --git a/src/main/java/com/fishercoder/common/classes/UndirectedGraphNode.java b/src/main/java/com/fishercoder/common/classes/UndirectedGraphNode.java
@@ -7,7 +7,7 @@
  * Created by fishercoder1534 on 9/30/16.
  */
 public class UndirectedGraphNode {
-    public int label;
+    public int val;
     public List<UndirectedGraphNode> neighbors;
 
     @Override
@@ -21,21 +21,21 @@ public boolean equals(Object o) {
 
         UndirectedGraphNode that = (UndirectedGraphNode) o;
 
-        if (label != that.label) {
+        if (val != that.val) {
             return false;
         }
         return neighbors != null ? neighbors.equals(that.neighbors) : that.neighbors == null;
     }
 
     @Override
     public int hashCode() {
-        int result = label;
+        int result = val;
         result = 31 * result + (neighbors != null ? neighbors.hashCode() : 0);
         return result;
     }
 
     public UndirectedGraphNode(int x) {
-        label = x;
+        val = x;
         neighbors = new ArrayList<>();
     }
 }
diff --git a/src/main/java/com/fishercoder/solutions/_133.java b/src/main/java/com/fishercoder/solutions/_133.java
@@ -7,59 +7,31 @@
 import java.util.Map;
 import java.util.Queue;
 
-/**
- * 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:
- Nodes are labeled uniquely.
-
- We use # as a separator for each node, and , as a separator for node label and each neighbor of the node.
- As an example, consider the serialized graph {0,1,2#1,2#2,2}.
-
- The graph has a total of three nodes, and therefore contains three parts as separated by #.
-
- First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
- Second node is labeled as 1. Connect node 1 to node 2.
- Third node is labeled as 2. Connect node 2 to node 2 (itself), thus forming a self-cycle.
- Visually, the graph looks like the following:
-
-    1
-   / \
-  /   \
- 0 --- 2
-      / \
-      \_/
-
- */
 public class _133 {
 
-  public static class Solution1 {
-    public UndirectedGraphNode cloneGraph(UndirectedGraphNode 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));
+    public static class Solution1 {
+        public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
+            if (node == null) {
+                return node;
+            }
+
+            Map<Integer, UndirectedGraphNode> map = new HashMap();
+            Queue<UndirectedGraphNode> queue = new LinkedList();
+            UndirectedGraphNode root = new UndirectedGraphNode(node.val);
+            map.put(root.val, 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.val)) {
+                        map.put(eachNode.val, new UndirectedGraphNode(eachNode.val));
+                        queue.offer(eachNode);
+                    }
+                    map.get(curr.val).neighbors.add(map.get(eachNode.val));
+                }
+            }
+            return root;
         }
-      }
-      return root;
     }
-  }
 }

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@`
`7`	`7`	`* Created by fishercoder1534 on 9/30/16.`
`8`	`8`	`*/`
`9`	`9`	`public class UndirectedGraphNode {`
`10`		`- public int label;`
	`10`	`+ public int val;`
`11`	`11`	`public List<UndirectedGraphNode> neighbors;`
`12`	`12`
`13`	`13`	`@Override`
`@@ -21,21 +21,21 @@ public boolean equals(Object o) {`
`21`	`21`
`22`	`22`	`UndirectedGraphNode that = (UndirectedGraphNode) o;`
`23`	`23`
`24`		`- if (label != that.label) {`
	`24`	`+ if (val != that.val) {`
`25`	`25`	`return false;`
`26`	`26`	`}`
`27`	`27`	`return neighbors != null ? neighbors.equals(that.neighbors) : that.neighbors == null;`
`28`	`28`	`}`
`29`	`29`
`30`	`30`	`@Override`
`31`	`31`	`public int hashCode() {`
`32`		`- int result = label;`
	`32`	`+ int result = val;`
`33`	`33`	`result = 31 * result + (neighbors != null ? neighbors.hashCode() : 0);`
`34`	`34`	`return result;`
`35`	`35`	`}`
`36`	`36`
`37`	`37`	`public UndirectedGraphNode(int x) {`
`38`		`- label = x;`
	`38`	`+ val = x;`
`39`	`39`	`neighbors = new ArrayList<>();`
`40`	`40`	`}`
`41`	`41`	`}`