题目:
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.
题意:
给定一个数组和常数k,求数组中出现频率最高的前k个元素
代码:
class Solution(object):
def topKFrequent(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: List[int]
"""
n = len(nums)
if k >= n :
return nums
else :
dic = {}
res = []
for x in nums :
if x not in dic :
dic[x] = 0
dic[x] += 1
dic = sorted(dic.items(), key=lambda item:item[1], reverse=True) #python的排序真不好记啊,排序后的结果是一个list,每个list元素也是个list,不再是字典的样子
for i in range(k) :
res.append(dic[i][0]) #dic[i][0]相当于原来字典的键
return res
笔记:
可能这个方法并不好