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

Example 1:

Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2]

Example 2:

Input: nums = [1], k = 1 Output: [1]

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.

?

from collections import Counterclass Solution(object):def topKFrequent(self, nums, k):""":type nums: List[int]:type k: int:rtype: List[int]"""count = Counter(nums)res = heapq.nlargest(k,count.keys(),key=count.get)return res

?

總結(jié)

以上是生活随笔為你收集整理的Leetcode - 347. Top K Frequent Elements(堆排序)的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。