Package g0301_0400.s0347_top_k_frequent_elements

Class Solution

java.lang.Object

g0301_0400.s0347_top_k_frequent_elements.Solution

public class Solution
extends Object

347 - Top K Frequent Elements\. Medium Given an integer array `nums` and an integer `k`, return _the_ `k` _most frequent elements_. You may return the answer in **any order**. **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 <= 105 * `k` is in the range `[1, the number of unique elements in the array]`. * It is **guaranteed** that the answer is **unique**. **Follow up:** Your algorithm's time complexity must be better than `O(n log n)`, where n is the array's size.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	topKFrequent(int[] nums, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

topKFrequent

public int[] topKFrequent(int[] nums,
 int k)