692. Top K Frequent Words
Problem:
Given a non-empty list of words, return the k most frequent elements.
Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with the lower alphabetical order comes first.
Example 1:
Input: ["i", "love", "leetcode", "i", "love", "coding"], k = 2
Output: ["i", "love"]
Explanation: "i" and "love" are the two most frequent words.
Note that "i" comes before "love" due to a lower alphabetical order.
Example 2:
Input: ["the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"], k = 4
Output: ["the", "is", "sunny", "day"]
Explanation: "the", "is", "sunny" and "day" are the four most frequent words,
with the number of occurrence being 4, 3, 2 and 1 respectively.
Note:
- You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
- Input words contain only lowercase letters.
Follow up:
- Try to solve it in O(n log k) time and O(n) extra space.
思路:
Solution (C++):
struct Cmp {
bool operator()(const pair<string, int>& p1, const pair<string, int>& p2) {
if (p1.second != p2.second) return p1.second < p2.second;
return p1.first > p2.first;
}
};
vector<string> topKFrequent(vector<string>& words, int k) {
unordered_map<string, int> freq;
for (auto w : words) ++freq[w];
priority_queue<pair<string, int>, vector<pair<string, int>>, Cmp> que;
vector<string> res;
for (auto f : freq) que.emplace(f.first, f.second);
while (k-- > 0 && !que.empty()) {
res.push_back(que.top().first);
que.pop();
}
return res;
}
性能:
Runtime: 20 ms Memory Usage: 9.4 MB
思路:
Solution (C++):
性能:
Runtime: ms Memory Usage: MB
相关链接如下:
知乎:littledy
GitHub主页:https://github.com/littledy
github.io:https://littledy.github.io/
欢迎关注个人微信公众号:小邓杂谈,扫描下方二维码即可
作者:littledy
本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文链接,否则保留追究法律责任的权利。