Top K Frequent Words问题及解法

问题描述：

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.

示例:

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.

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.

问题分析：

统计每个单词出现的次数，依次从大到小排序，顺序从头开始输出k的元素即为答案。

过程详见代码：

struct cmp{
	bool operator() (pair<string, int> a, pair<string, int> b){
		if (a.second == b.second) return a.first > b.first;
		return a.second < b.second;
	}
};

class Solution {
public:
	vector<string> topKFrequent(vector<string>& words, int k) {
		unordered_map<string, int> map;
		priority_queue<pair<string, int>, vector<pair<string, int>>,cmp> que;
		vector<string> res;
		for (string s : words)
		{
			map[s]++;
		}
		for (auto p : map)
		{
			que.push(p);
		}
		for (int i = 0; i < k; i++)
		{
			res.emplace_back(que.top().first);
			que.pop();
		}
		return res;
	}
};