parent
2da3afe8a9
commit
e361eddedd
|
|
@ -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; 注意是 <=
|
||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue