内容简介：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].
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.
func topKFrequent(_ nums: [Int], _ k: Int) -> [Int] {
var dict = [Int:Int]()
nums.forEach {
dict[$0] = (dict[$0] == nil ? 0 : dict[$0]! ) + 1
}
return dict.sorted(by: { $0.value > $1.value } )[0..<k].map({$0.key})
}
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持 码农网
猜你喜欢:
本站部分资源来源于网络，本站转载出于传递更多信息之目的，版权归原作者或者来源机构所有，如转载稿涉及版权问题，请联系我们。
