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.<p>Medium</p> <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><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,1,1,2,2,3], k = 2</p> <p><strong>Output:</strong> [1,2]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1], k = 1</p> <p><strong>Output:</strong> [1]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <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><strong>Follow up:</strong> Your algorithm&rsquo;s time complexity must be better than <code>O(n log n)</code>, where n is the array&rsquo;s size.</p>

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)