refactor 261

fishercoder1534 · fishercoder1534 · commit 7fe62a0d3c74 · 2018-11-06T07:41:22.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_261.java b/src/main/java/com/fishercoder/solutions/_261.java
@@ -2,7 +2,8 @@
 
 /**
  *261. Graph Valid Tree
- *Given n nodes labeled from 0 to n - 1 and a list of undirected edges
+ *
+ * Given n nodes labeled from 0 to n - 1 and a list of undirected edges
  * (each edge is a pair of nodes),
  * write a function to check whether these edges make up a valid tree.
 
@@ -24,31 +25,33 @@
  */
 public class _261 {
 
-    public boolean validTree(int n, int[][] edges) {
-        int[] nums = new int[n];
-        for (int i = 0; i < n; i++) {
-            nums[i] = i;
-        }
+    public static class Solution1 {
+        public boolean validTree(int n, int[][] edges) {
+            int[] nums = new int[n];
+            for (int i = 0; i < n; i++) {
+                nums[i] = i;
+            }
+
+            for (int i = 0; i < edges.length; i++) {
+                int x = find(nums, edges[i][0]);
+                int y = find(nums, edges[i][1]);
 
-        for (int i = 0; i < edges.length; i++) {
-            int x = find(nums, edges[i][0]);
-            int y = find(nums, edges[i][1]);
+                if (x == y) {
+                    return false;
+                }
 
-            if (x == y) {
-                return false;
+                //union
+                nums[x] = y;
             }
 
-            //union
-            nums[x] = y;
+            return edges.length == n - 1;
         }
 
-        return edges.length == n - 1;
-    }
-
-    int find(int[] nums, int i) {
-        if (nums[i] == i) {
-            return i;
+        int find(int[] nums, int i) {
+            if (nums[i] == i) {
+                return i;
+            }
+            return find(nums, nums[i]);
         }
-        return find(nums, nums[i]);
     }
 }
