## Description

https://leetcode.com/problems/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 = 2Output:["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 = 4Output:["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.

## Explanation

Similar to Top K Frequent Elements, just by using a heap is easy to count top K frequent.

## Python Solution

```
class Solution:
def topKFrequent(self, words: List[str], k: int) -> List[str]:
results = []
count = {}
for word in words:
count[word] = count.get(word, 0) + 1
heap = []
for key, value in count.items():
heapq.heappush(heap, (-value, key))
for i in range(k):
results.append(heapq.heappop(heap)[1])
return results
```

- Time complexity: O(N log K), where N is the length of words. We count the frequency of each word in O(N) time, then we add N words to the heap, each in O(log k) time. Finally, we pop from the heap up to K times. As K <= N, this is O(N log K) in total.
- Space complexity: O(N). The space used to store our count.

doesn’t work