347.-top-k-frequency.md

347. Top K frequency

{% tabs %} {% tab title="Python-heap" %}

class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
        dit = collections.defaultdict(int)
        for v in nums:
            dit[v] += 1
        numbers = [ (-v , k ) for k,v in dit.items()]
        heapq.heapify(numbers)
        ans = []
        while k:
            cnt, key = heapq.heappop(numbers)
            ans.append(key)
            k -= 1
        return ans
        

{% endtab %} {% endtabs %}