Commit cd21345

committed

修正内容错误

1 parent 9b65c86 commit cd21345Copy full SHA for cd21345

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -120,6 +120,6 @@ class Solution:`
`120`	`120`
`121`	`121`	`### 思路 1:复杂度分析`
`122`	`122`
`123`		`-- 时间复杂度:$O(m \times n \times \alpha(m \times n)),ドル其中 $\alpha$ 是反 Ackerman 函数。`
	`123`	`+- 时间复杂度:$O(m \times n \times \log(m \times n)),ドル其中 $m$ 和 $n$ 分别为矩阵的行数和列数。主要耗时在于对所有边进行排序,排序复杂度为 $O(m \times n \times \log(m \times n)),ドル并查集的合并与查找操作均摊为常数级。`
`124`	`124`	`- 空间复杂度:$O(m \times n)$。`
`125`	`125`

Comments

(0)