Given an integer array nums and an integer k, return the k most frequent elements. You can return them in any order.
The answer is guaranteed to be unique.
Examples
Example 1
- Input
- nums = [1, 1, 1, 2, 2, 3], k = 2
- Output
- [1, 2]
Example 2
- Input
- nums = [1], k = 1
- Output
- [1]
Constraints
1 <= nums.length <= 10^51 <= k <=the number of distinct values innums