Update 图论并查集理论基础.md

liuhao230 · web-flow · commit e361eddeddf3 · 2024-02-27T21:58:01.000+08:00
修正语病
diff --git a/problems/图论并查集理论基础.md b/problems/图论并查集理论基础.md
@@ -396,7 +396,7 @@ void join(int u, int v) {
     if (rank[u] <= rank[v]) father[u] = v; // rank小的树合入到rank大的树
     else father[v] = u;
 
-    if (rank[u] == rank[v] && u != v) rank[v]++; // 如果两棵树高度相同，则v的高度+1因为，上面 if (rank[u] <= rank[v]) father[u] = v; 注意是 <=
+    if (rank[u] == rank[v] && u != v) rank[v]++; // 如果两棵树高度相同，则v的高度+1，因为上面 if (rank[u] <= rank[v]) father[u] = v; 注意是 <=
 }
 ```
 

Original file line number	Diff line number	Diff line change
`@@ -396,7 +396,7 @@ void join(int u, int v) {`
`396`	`396`	`if (rank[u] <= rank[v]) father[u] = v; // rank小的树合入到rank大的树`
`397`	`397`	`else father[v] = u;`
`398`	`398`
`399`		`- if (rank[u] == rank[v] && u != v) rank[v]++; // 如果两棵树高度相同，则v的高度+1因为，上面 if (rank[u] <= rank[v]) father[u] = v; 注意是 <=`
	`399`	`+ if (rank[u] == rank[v] && u != v) rank[v]++; // 如果两棵树高度相同，则v的高度+1，因为上面 if (rank[u] <= rank[v]) father[u] = v; 注意是 <=`
`400`	`400`	`}`
`401`	`401`	```
`402`	`402`