算法：Top K frequent word

最新推荐文章于 2021-02-05 14:57:00 发布

changyu_jiang

最新推荐文章于 2021-02-05 14:57:00 发布

阅读量310

点赞数

分类专栏：算法文章标签：算法数据结构

本文链接：https://blog.csdn.net/u014304769/article/details/78466389

版权

给定一个包含不同单词的文本，返回出现频率最高的前K个单词。当K大于单词的种类数时，返回所有不同的单词，按频率降序排列。文章提出了计算每个单词频率并使用最小堆来维护Top K高频词的思路。

摘要由CSDN通过智能技术生成

Given a composition with different kinds of words, return a list of the top K most frequent words in the composition.
Assumptions
the composition is not null and is not guaranteed to be sorted
K >= 1 and K could be larger than the number of distinct words in the composition, in this case, just return all the distinct words
Return
a list of words ordered from most frequent one to least frequent one (the list could be of size K or smaller than K)
Examples
Composition = [“a”, “a”, “b”, “b”, “b”, “b”, “c”, “c”, “c”, “d”], top 2 frequent words are [“b”, “c”]
Composition = [“a”, “a”, “b”, “b”, “b”, “b”, “c”, “c”, “c”, “d”], top 4 frequent words are [“b”, “c”, “a”, “d”]
Composition = [“a”, “a”, “b”, “b”, “b”, “b”, “c”, “c”, “c”, “d”], top 5 frequent words are [“b”, “c”, “a”, “d”]

Ideas
Calculate frequencies of each word and sto