- Given an integer array
numsand an integer
k, return the
kmost frequent elements. You may return the answer in any order.
- This challenge corresponds to LeetCode #347.
1 <= nums.length <= 105
kis in the range
[1, the number of unique elements in the array].
- It is guaranteed that the answer is unique.
Input: nums = [1, 1, 1, 2, 2, 3], k = 2 Output: [1, 2]
Input: nums = , k = 1 Output: 
Below is my solution and some test cases. This solution has a linear time complexity O(n) and a linear space complexity O(n), where n is the length of the input list.