modify code

Author: algorithmzuo

src/class165/Code02_UndoUnionFind1.java

@@ -79,13 +79,13 @@ public static void dfs(int u, int fa) {
 		boolean added = false;
 		boolean unioned = false;
 		if (fx == fy) {
-			if (edgeCnt[fx] < siz[fx]) {
+			if (edgeCnt[fx] == siz[fx] - 1) {
 				ball++;
 				added = true;
 			}
 			edgeCnt[fx]++;
 		} else {
-			if (edgeCnt[fx] < siz[fx] || edgeCnt[fy] < siz[fy]) {
+			if (edgeCnt[fx] == siz[fx] - 1 || edgeCnt[fy] == siz[fy] - 1) {
 				ball++;
 				added = true;
 			}

src/class165/Code02_UndoUnionFind2.java

@@ -75,13 +75,13 @@
 //    bool added = false;
 //    bool unioned = false;
 //    if (fx == fy) {
-//        if (edgeCnt[fx] < siz[fx]) {
+//        if (edgeCnt[fx] == siz[fx] - 1) {
 //            ball++;
 //            added = true;
 //        }
 //        edgeCnt[fx]++;
 //    } else {
-//        if (edgeCnt[fx] < siz[fx] || edgeCnt[fy] < siz[fy]) {
+//        if (edgeCnt[fx] == siz[fx] - 1 || edgeCnt[fy] == siz[fy] - 1) {
 //            ball++;
 //            added = true;
 //        }