[LeetCode][Python3] 347. Top K Frequent Elements

Problem :

https://leetcode.com/problems/top-k-frequent-elements/

My Solution :

class Solution:

def topKFrequent(self, nums, k):

"""

:type nums: List[int]

:type k: int

:rtype: List[int]

"""

count = {}

for n in nums:

count[n] = count.get(n, 0) + 1

bucket = [[] for _ in range(len(nums)+1)]

for n, freq in count.items():

bucket[freq].append(n)

ret = []

for n_list in bucket[::-1]:

if n_list:

ret.extend(n_list)

if len(ret) == k:

return ret