From e361eddeddf3c86ed53b360861fb90703d7e95ce Mon Sep 17 00:00:00 2001
From: sss1h <49825610+sss1h@users.noreply.github.com>
Date: Tue, 27 Feb 2024 21:58:01 +0800
Subject: [PATCH] =?UTF-8?q?Update=20=E5=9B=BE=E8=AE=BA=E5=B9=B6=E6=9F=A5?=
 =?UTF-8?q?=E9=9B=86=E7=90=86=E8=AE=BA=E5=9F=BA=E7=A1=80.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

修正语病
---
 problems/图论并查集理论基础.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/图论并查集理论基础.md b/problems/图论并查集理论基础.md
index a65d4807..6a1456e9 100644
--- 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; 注意是 <=
 }
 ```