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 f3ee7fd

Browse files
committed
Update stack_queue.md
1 parent 7b84ef6 commit f3ee7fd

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎data_structure/stack_queue.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -333,7 +333,7 @@ class Solution:
333333
```
334334

335335
### [top-k-frequent-elements](https://leetcode.cn/problems/top-k-frequent-elements/)
336-
> 给你一个整数数组 nums 和一个整数 k ,请你返回其中出现频率前 k 高的元素。你可以按 任意顺序 返回答案。
336+
> 给你一个整数数组 nums 和一个整数 k ,请你返回其中出现频率前 k 高的元素。你可以按 **任意顺序** 返回答案。
337337
338338
思路:top-k经典题目,利用最小堆或者最大堆, python里面只有最小堆
339339

0 commit comments

Comments
(0)

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