Package g0301_0400.s0347_top_k_frequent_elements

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>-10<sup>4</sup><= numsi<= 10<sup>4</sup></code>

    • 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.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray topKFrequent(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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