leetcode 347. Top K Frequent Elements

发表于 | 分类于

Given a non-empty array of integers, return the k most frequent elements.

For example,
Given [1,1,1,2,2,3] and k = 2, return [1,2].

Note:

  • You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
  • Your algorithm’s time complexity must be better than O(n log n), where n is the array’s size.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
import heapq
class Solution(object):
    def topKFrequent(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: List[int]
        """
        d = {}
        for i in nums:
            if i not in d:d[i] = 1
            else: d[i] += 1
        
        return heapq.nlargest(k,d,key=lambda x:d[x])