LEETCODE 347. 前 K 个高频元素

class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
        res=[]
        heap=[]
        dic=Counter(nums)
        for i in dic:
            heapq.heappush(heap,[-dic[i],i])
        for _ in range(k):
            res.append(heapq.heappop(heap)[1])
        return res