top-k-frequent-words

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array of strings <code>words</code> and an integer <code>k</code>, return the <code>k</code> most frequent strings.

Return the answer sorted by the frequency from highest to lowest. Sort the words with the same frequency by their lexicographical order.

&nbsp;
Example 1:

<pre>
Input: words = [&quot;i&quot;,&quot;love&quot;,&quot;leetcode&quot;,&quot;i&quot;,&quot;love&quot;,&quot;coding&quot;], k = 2
Output: [&quot;i&quot;,&quot;love&quot;]
Explanation: &quot;i&quot; and &quot;love&quot; are the two most frequent words.
Note that &quot;i&quot; comes before &quot;love&quot; due to a lower alphabetical order.
</pre>

Example 2:

<pre>
Input: words = [&quot;the&quot;,&quot;day&quot;,&quot;is&quot;,&quot;sunny&quot;,&quot;the&quot;,&quot;the&quot;,&quot;the&quot;,&quot;sunny&quot;,&quot;is&quot;,&quot;is&quot;], k = 4
Output: [&quot;the&quot;,&quot;is&quot;,&quot;sunny&quot;,&quot;day&quot;]
Explanation: &quot;the&quot;, &quot;is&quot;, &quot;sunny&quot; and &quot;day&quot; are the four most frequent words, with the number of occurrence being 4, 3, 2 and 1 respectively.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= words.length &lt;= 500</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 10</code></li>
	<li><code>words[i]</code> consists of lowercase English letters.</li>
	<li><code>k</code> is in the range <code>[1, The number of unique words[i]]</code></li>
</ul>

&nbsp;
Follow-up: Could you solve it in <code>O(n log(k))</code> time and <code>O(n)</code> extra space?

topKFrequent

Top K Frequent Words

Top K Frequent Elements

top-k-frequent-elements

前 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

最多单词数的发件人

Maximum Number of Pairs in Array

maximum-number-of-pairs-in-array

数组能形成多少数对

Trie

Array

Hash Table

String

Bucket Sort

Counting

Sorting

Heap (Priority Queue)

给定一个单词列表&nbsp;<code>words</code>&nbsp;和一个整数 <code>k</code> ，返回前&nbsp;<code>k</code>&nbsp;个出现次数最多的单词。

返回的答案应该按单词出现频率由高到低排序。如果不同的单词有相同出现频率， 按字典顺序 排序。

&nbsp;

示例 1：

<pre>
输入: words = ["i", "love", "leetcode", "i", "love", "coding"], k = 2
输出: ["i", "love"]
解析: "i" 和 "love" 为出现次数最多的两个单词，均为2次。
 注意，按字母顺序 "i" 在 "love" 之前。
</pre>

示例 2：

<pre>
输入: ["the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"], k = 4
输出: ["the", "is", "sunny", "day"]
解析: "the", "is", "sunny" 和 "day" 是出现次数最多的四个单词，
 出现次数依次为 4, 3, 2 和 1 次。
</pre>

&nbsp;

注意：

<ul>
	<li><code>1 &lt;= words.length &lt;= 500</code></li>
	<li><code>1 &lt;= words[i] &lt;= 10</code></li>
	<li><code>words[i]</code>&nbsp;由小写英文字母组成。</li>
	<li><code>k</code> 的取值范围是&nbsp;<code>[1, 不同 words[i] 的数量]</code></li>
</ul>

&nbsp;

进阶：尝试以&nbsp;<code>O(n log k)</code> 时间复杂度和&nbsp;<code>O(n)</code> 空间复杂度解决。