692.md

Top K Frequent Words

Description

link

---

Solution

• See Code

---

Code 1

Complexity T : O(nlog(n)) M : O(n)

class Solution:
    def topKFrequent(self, words: List[str], k: int) -> List[str]:
        cnt = collections.Counter(words)
        q = []
        for w, c in cnt.items():
            heapq.heappush(q, (-c, w))
        res = []
        for i in range(k):
            res.append(heapq.heappop(q)[1])
        return res