2022-03-27 18:35:17 +08:00
< p > Given an integer array < code > nums< / code > and an integer < code > k< / code > , return < em > the< / em > < code > k< / code > < em > most frequent elements< / em > . You may return the answer in < strong > any order< / strong > .< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< pre > < strong > Input:< / strong > nums = [1,1,1,2,2,3], k = 2
< strong > Output:< / strong > [1,2]
2023-12-09 18:42:21 +08:00
< / pre > < p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< pre > < strong > Input:< / strong > nums = [1], k = 1
< strong > Output:< / strong > [1]
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > < code > 1 < = nums.length < = 10< sup > 5< / sup > < / code > < / li >
2023-12-09 18:42:21 +08:00
< li > < code > -10< sup > 4< / sup > < = nums[i] < = 10< sup > 4< / sup > < / code > < / li >
2022-03-27 18:35:17 +08:00
< li > < code > k< / code > is in the range < code > [1, the number of unique elements in the array]< / code > .< / li >
< li > It is < strong > guaranteed< / strong > that the answer is < strong > unique< / strong > .< / li >
< / ul >
< p > < / p >
< p > < strong > Follow up:< / strong > Your algorithm' s time complexity must be better than < code > O(n log n)< / code > , where n is the array' s size.< / p >
