Commit e361edd

authored

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

修正语病

1 parent 2da3afe commit e361eddCopy full SHA for e361edd

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

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`

Comments

(0)