use index as its ID

fishercoder1534 · fishercoder1534 · commit bb078caca998 · 2016-09-30T09:56:13.000-07:00
diff --git a/MEDIUM/src/medium/GraphValidTree.java b/MEDIUM/src/medium/GraphValidTree.java
@@ -9,7 +9,7 @@ public class GraphValidTree {
 
     public boolean validTree(int n, int[][] edges){
         int[] nums = new int[n];
-        Arrays.fill(nums, -1);
+        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]);
@@ -25,7 +25,7 @@ public boolean validTree(int n, int[][] edges){
     }
 
     int find(int[] nums, int i){
-        if(nums[i] == -1) return i;
+        if(nums[i] == i) return i;
         return find(nums, nums[i]);
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -9,7 +9,7 @@ public class GraphValidTree {`
`9`	`9`
`10`	`10`	`public boolean validTree(int n, int[][] edges){`
`11`	`11`	`int[] nums = new int[n];`
`12`		`- Arrays.fill(nums, -1);`
	`12`	`+ for(int i =0; i < n; i++) nums[i] = i;`
`13`	`13`
`14`	`14`	`for(int i = 0; i < edges.length; i++){`
`15`	`15`	`int x = find(nums, edges[i][0]);`
`@@ -25,7 +25,7 @@ public boolean validTree(int n, int[][] edges){`
`25`	`25`	`}`
`26`	`26`
`27`	`27`	`int find(int[] nums, int i){`
`28`		`- if(nums[i] == -1) return i;`
	`28`	`+ if(nums[i] == i) return i;`
`29`	`29`	`return find(nums, nums[i]);`
`30`	`30`	`}`
`31`	`31`	`}`