692. 前K个高频单词

class Solution:
def topKFrequent(self, words, k):
v1_dict = {}
for i in words:
v1_dict[i] = v1_dict.get(i,0)+1
data = sorted(v1_dict.items(),key=lambda x:(-x[1],x[0]))[:k]
return [i[0] for i in data]
思路
搞个字典,然后将字符出现的次数塞进字典里,然后在排序
先按频率排序,先按在按A-Z排序
key=lambda x:(-x[1],x[0]),表示排序参考的是(-x[1],x[0]),先参考-x[1]也就是出现次数的负数排序,在根据x[0]也就是A-Z排序
参考:https://leetcode-cn.com/problems/top-k-frequent-words/solution/by-6oofy-elbakyankt3-e77q/

浙公网安备 33010602011771号