Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit f1c88c5

Browse files
author
luzhipeng
committed
fix: typo
1 parent 1c6742a commit f1c88c5

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎problems/215.kth-largest-element-in-an-array.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -42,7 +42,7 @@ You may assume k is always valid, 1 ≤ k ≤ array's length.
4242
例如:
4343
![heap](../assets/problems/215.kth-largest-element-in-an-array-heap.jpg)
4444

45-
*时间复杂度*:`O(n * logk) - n is array length`
45+
*时间复杂度*:`O(n * logk) , n is array length`
4646
*空间复杂度*:`O(k)`
4747

4848
跟排序相比,以空间换时间。
@@ -68,7 +68,7 @@ Quick Select 类似快排,选取pivot,把小于pivot的元素都移到pivot
6868
![quick select](../assets/problems/215.kth-largest-element-in-an-array-quick-select.jpg)
6969

7070
*时间复杂度*:
71-
- 平均是:`O(n)`
71+
- 平均是:`O(n)`
7272
- 最坏的情况是:`O(n * n)`
7373

7474
## 关键点分析

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /