347. Top K Frequent Elements【M】【VIP】【字典排序】

最新推荐文章于 2020-12-12 15:35:15 发布

sscssz

最新推荐文章于 2020-12-12 15:35:15 发布

阅读量466

点赞数

分类专栏： leetcode Python 算法数据结构哈希文章标签： hash leetcode题解 python leetcode lambda

本文链接：https://blog.csdn.net/sscssz/article/details/51353111

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

算法

157 篇文章 0 订阅

订阅专栏

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.

Subscribe to see which companies asked this question

这个其实挺简单，就是用hash，然后再排序

class Solution(object):
    def topKFrequent(self, nums, k):
        
        dic = {}
        
        for i in nums:
            dic[i] = dic.get(i,0) + 1
        
        #print dic.items()
        l = sorted(dic.iteritems(),key = lambda d:d[1], reverse = True)
        
        res = []
        for i in xrange(k):
            res += l[i][0],
        return res