# 692. Top-K-Frequent-Words

difficulty: Medium

&#x20;section pre{ background-color: #eee; border: 1px solid #ddd; padding:10px; border-radius: 5px; }&#x20;

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.

## Method One

```java
class Solution {
    public List<String> topKFrequent(String[] words, int k) {
        Map< String, Integer > frequencies = new HashMap<>();
        for(String word : words) {
            frequencies.putIfAbsent( word , 0);
            frequencies.put( word , frequencies.get(word) + 1);
        }

        PriorityQueue<String> minHeap = new PriorityQueue<>( (a,b) -> {
            if( frequencies.get(a) != frequencies.get(b) ) {
                return frequencies.get(a)  -  frequencies.get(b);
            }
            return -a.compareTo(b);
        });

        for(String word : frequencies.keySet()) {
            minHeap.offer(word);
            while(minHeap.size() > k ) {
                minHeap.poll();
            }
        } 
        LinkedList<String> res = new LinkedList<>();
        while( !minHeap.isEmpty() ) {
            res.addFirst(minHeap.poll());
        }
        return res;
    }
}
​
```
