Given an integer array nums
and an integer k
, return the k
most frequent elements. You may return the answer in any order.
Example 1:
Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2]
Example 2:
Input: nums = [1], k = 1 Output: [1]
Constraints:
1 <= nums.length <= 105
k
is in the range[1, the number of unique elements in the array]
.- It is guaranteed that the answer is unique.
题目给定一个数组nums和一个整数k,有些数字在数组nums里可能出现多次。要求找出出现频率最高的k个数字。
很明显是一道Top K的题目,可以用优先级队列来搞定,由于要保留频率高的数字排除频率低的数字,可以使用最小堆,heapq默认就是最小堆: