← 返回 amazon 的题目列表Top K Frequent Elements
类型：online_judge
Given a non-empty array of integers, return the k most frequent elements. You may assume that k is always valid, 1 ≤ k ≤ number of unique elements.
Example:
Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2]
Input: nums = [1], k = 1 Output: [1]
Example
Input
[1,1,1,2,2,3], 2