Top K Frequent Elements

Medium

Given an integer array nums and an integer k, return the k most frequent elements. On this judge the answer is returned sorted in ascending order, and the inputs guarantee the k most frequent elements are unambiguous.

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^5
• k is in the range [1, number of distinct elements]
• The k most frequent elements are unique.