algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
修正语病
This commit is contained in:
sss1h
2024-02-27 21:58:01 +08:00
committed by GitHub
parent 2da3afe8a9
commit e361eddedd
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/图论并查集理论基础.md
View File

@ -396,7 +396,7 @@ void join(int u, int v) {
if (rank[u] <= rank[v]) father[u] = v; // rank小的树合入到rank大的树 if (rank[u] <= rank[v]) father[u] = v; // rank小的树合入到rank大的树
else father[v] = u; 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; 注意是 <=
} }
``` ```