modify code

algorithmzuo · algorithmzuo · commit b6d244f4f59b · 2025-07-15T20:00:09.000+08:00
diff --git a/src/class174/Code03_ColorfulWorld1.java b/src/class174/Code03_ColorfulWorld1.java
@@ -46,17 +46,20 @@ public class Code03_ColorfulWorld1 {
 	// 查询的答案
 	public static int[] ans = new int[MAXM];
 
+	// 查询x值变成了什么
 	public static int find(int x) {
 		if (x != fa[x]) {
 			fa[x] = find(fa[x]);
 		}
 		return fa[x];
 	}
 
+	// 所有x值变成y值
 	public static void union(int x, int y) {
 		fa[find(x)] = find(y);
 	}
 
+	// 根据值域并查集的修改结果，把修改写入arr[l..r]
 	public static void down(int l, int r) {
 		for (int i = l; i <= r; i++) {
 			arr[i] = find(arr[i]);

Original file line number	Diff line number	Diff line change
`@@ -46,17 +46,20 @@ public class Code03_ColorfulWorld1 {`
`46`	`46`	`// 查询的答案`
`47`	`47`	`public static int[] ans = new int[MAXM];`
`48`	`48`
	`49`	`+ // 查询x值变成了什么`
`49`	`50`	`public static int find(int x) {`
`50`	`51`	`if (x != fa[x]) {`
`51`	`52`	`fa[x] = find(fa[x]);`
`52`	`53`	`}`
`53`	`54`	`return fa[x];`
`54`	`55`	`}`
`55`	`56`
	`57`	`+ // 所有x值变成y值`
`56`	`58`	`public static void union(int x, int y) {`
`57`	`59`	`fa[find(x)] = find(y);`
`58`	`60`	`}`
`59`	`61`
	`62`	`+ // 根据值域并查集的修改结果，把修改写入arr[l..r]`
`60`	`63`	`public static void down(int l, int r) {`
`61`	`64`	`for (int i = l; i <= r; i++) {`
`62`	`65`	`arr[i] = find(arr[i]);`