[LeetCode]Top K Frequent Words@Python

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

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.

Solution

#注意sorted的用法，可以针对二维数据进行排序
import collections
class Solution:
    def topKFrequent(self, words: List[str], k: int) -> List[str]:
        return [w for w, v in sorted(collections.Counter(words).items(), key = lambda x: (-x[1], x[0])) [:k]]