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

修正语病
2024-02-27 21:58:01 +08:00 · 2024-02-27 21:58:01 +08:00 · e361eddedd
parent 2da3afe8a9
commit e361eddedd
1 changed files with 1 additions and 1 deletions
--- 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; 注意是 <=
 }
 ```