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.

---

又是一道经典top k系列。依旧是一样的heap思路，先把整个数组扫一遍统计每个单词的出现次数放进hashmap，然后再扫一遍hashmap放进heap，heap采用size为k的min heap这样就可以logK解决了。主要需要注意的一点就是因为采用的是min heap，按顺序poll出来的元素是从第k大到第一大，所以最后要reverse一下，并且因为说了要按字母序排序，所以刚开始comparator里面也要注意如果次数相等就要按倒序字母序排序。时间复杂的：O(nlogk)，空间O(n)。

Runtime: 5 ms, faster than 92.48% of Java online submissions for Top K Frequent Words.

Memory Usage: 39.5 MB, less than 79.71% of Java online submissions for Top K Frequent Words.

class Solution {
    public List<String> topKFrequent(String[] words, int k) {
        Map<String, Integer> wordToFreq = new HashMap<>();
        for (String word : words) {
            int count = wordToFreq.getOrDefault(word, 0);
            count++;
            wordToFreq.put(word, count);
        }
        
        PriorityQueue<Map.Entry<String, Integer>> pq = new PriorityQueue<>((a, b) -> a.getValue() == b.getValue() ? b.getKey().compareTo(a.getKey()) : a.getValue().compareTo(b.getValue()));
        for (Map.Entry<String, Integer> entry : wordToFreq.entrySet()) {
            pq.add(entry);
            if (pq.size() > k) {
                pq.poll();
            }
        }
        
        List<String> result = new ArrayList<>();
        while (!pq.isEmpty()) {
            result.add(pq.poll().getKey());
        }
        Collections.reverse(result);
        return result;
    }
}