top-k-frequent-elements

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer array <code>nums</code> and an integer <code>k</code>, return the <code>k</code> most frequent elements. You may return the answer in any order.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,1,1,2,2,3], k = 2

Output: [1,2]
</div>

Example 2:

<div class="example-block">
Input: nums = [1], k = 1

Output: [1]
</div>

Example 3:

<div class="example-block">
Input: nums = [1,2,1,2,1,2,3,1,3,2], k = 2

Output: [1,2]
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</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 guaranteed that the answer is unique.</li>
</ul>

&nbsp;
Follow up: Your algorithm&#39;s time complexity must be better than <code>O(n log n)</code>, where n is the array&#39;s size.

topKFrequent

Top K Frequent Elements

Word Frequency

word-frequency

统计词频

Kth Largest Element in an Array

kth-largest-element-in-an-array

数组中的第K个最大元素

Sort Characters By Frequency

sort-characters-by-frequency

根据字符出现频率排序

Split Array into Consecutive Subsequences

split-array-into-consecutive-subsequences

分割数组为连续子序列

Top K Frequent Words

top-k-frequent-words

前K个高频单词

K Closest Points to Origin

k-closest-points-to-origin

最接近原点的 K 个点

Sort Features by Popularity

sort-features-by-popularity

按受欢迎程度排列功能

Sender With Largest Word Count

sender-with-largest-word-count

最多单词数的发件人

Most Frequent Even Element

most-frequent-even-element

出现最频繁的偶数元素

Linked List Frequency

linked-list-frequency

链表频率

Array

Hash Table

Divide and Conquer

Bucket Sort

Counting

Quickselect

Sorting

Heap (Priority Queue)

给你一个整数数组 <code>nums</code> 和一个整数 <code>k</code> ，请你返回其中出现频率前 <code>k</code> 高的元素。你可以按 任意顺序 返回答案。

&nbsp;

示例 1：

<div class="example-block">
输入：nums = [1,1,1,2,2,3], k = 2

输出：[1,2]
</div>

示例 2：

<div class="example-block">
输入：nums = [1], k = 1

输出：[1]
</div>

示例 3：

<div class="example-block">
输入：nums = [1,2,1,2,1,2,3,1,3,2], k = 2

输出：[1,2]
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>k</code> 的取值范围是 <code>[1, 数组中不相同的元素的个数]</code></li>
	<li>题目数据保证答案唯一，换句话说，数组中前 <code>k</code> 个高频元素的集合是唯一的</li>
</ul>

&nbsp;

进阶：你所设计算法的时间复杂度 必须 优于 <code>O(n log n)</code> ，其中 <code>n</code>&nbsp;是数组大小。