[Leetcode] 692. 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.

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:

1. You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
2. Input words contain only lowercase letters.

Follow up:

1. Try to solve it in O(n log k) time and O(n) extra space.

思路：

分为三步走：1）定义哈希表hash，建立从单词到其出现频次的映射；2）根据哈希表建立一个大顶堆heap；3）依次取出大顶堆的前k个元素，并且返回。

算法的时间复杂度是O(2n + klogn)，空间复杂度是O(n)。

代码：

class Solution {
public:
    vector<string> topKFrequent(vector<string>& words, int k) {
        // step 1: calculate the frequency of each word
        unordered_map<string, int> hash;
        for (auto &word : words) {
            ++hash[word];
        }
        // step 2: construct the heap
        vector<pair<int, string>> heap;
        for (auto it = hash.begin(); it != hash.end(); ++it) {
            heap.push_back(make_pair(it->second, it->first));
        }
        make_heap(heap.begin(), heap.end(), pairCompare);
        // step 3: construct the result
        vector<string> ans;
        for (int i = 0; i < k; ++i) {
            ans.push_back(heap[0].second);
            pop_heap(heap.begin(), heap.end(), pairCompare);
            heap.pop_back();
        }
        return ans;
    }
private:
    static bool pairCompare(pair<int, string> &a, pair<int, string> &b) {
        if (a.first == b.first) {
            return a.second > b.second;
        }
        else {
            return a.first < b.first;
        }
    }
};