mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 11:08:15 +08:00
39 lines
1.5 KiB
HTML
39 lines
1.5 KiB
HTML
|
<p>给定一个单词列表 <code>words</code> 和一个整数 <code>k</code> ，返回前 <code>k</code><em> </em>个出现次数最多的单词。</p>
|
|||
|
|
|
|||
|
|
<p>返回的答案应该按单词出现频率由高到低排序。如果不同的单词有相同出现频率， <strong>按字典顺序</strong> 排序。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入:</strong> words = ["i", "love", "leetcode", "i", "love", "coding"], k = 2
|
|||
|
|
<strong>输出:</strong> ["i", "love"]
|
|||
|
|
<strong>解析:</strong> "i" 和 "love" 为出现次数最多的两个单词，均为2次。
|
|||
|
|
注意，按字母顺序 "i" 在 "love" 之前。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入:</strong> ["the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"], k = 4
|
|||
|
|
<strong>输出:</strong> ["the", "is", "sunny", "day"]
|
|||
|
|
<strong>解析:</strong> "the", "is", "sunny" 和 "day" 是出现次数最多的四个单词，
|
|||
|
|
出现次数依次为 4, 3, 2 和 1 次。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>注意：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= words.length <= 500</code></li>
|
|||
|
|
<li><code>1 <= words[i] <= 10</code></li>
|
|||
|
|
<li><code>words[i]</code> 由小写英文字母组成。</li>
|
|||
|
|
<li><code>k</code> 的取值范围是 <code>[1, <strong>不同</strong> words[i] 的数量]</code></li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>进阶：</strong>尝试以 <code>O(n log k)</code> 时间复杂度和 <code>O(n)</code> 空间复杂度解决。</p>
|