Finding the top K frequent elements from the array/list of integers

topKFrequent.py

from heapq import heappush, heappop
from collections import defaultdict

class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
        if nums == []:
            return []
        map = {}
        for num in nums:
            if num in map:
                map[num] += 1
            else:
                map[num] = 1
        maxx = 0
        heap = []
        for key,value in map.items():
            if len(heap) < k:
                heappush(heap,[value,key])
            elif heap[0][0] < value:
                heappop(heap)
                heappush(heap,[value,key])
        return [item for count,item in heap[::-1]]