描述
给定一个字符串数组,再给定整数k,请返回出现次数前k名的字符串和对应的次数。
返回的答案应该按字符串出现频率由高到低排序。如果不同的字符串有相同出现频率,按字典序排序。
对于两个字符串,大小关系取决于两个字符串从左到右第一个不同字符的 ASCII 值的大小关系。
比如"ah1x"小于"ahb","231"<”32“
字符仅包含数字和字母
[要求]
如果字符串数组长度为N,时间复杂度请达到O(N \log K)O(NlogK)
示例1
输入:
["a","b","c","b"],2
复制返回值:
[["b","2"],["a","1"]]
复制说明:
"b"出现了2次,记["b","2"],"a"与"c"各出现1次,但是a字典序在c前面,记["a","1"],最后返回[["b","2"],["a","1"]]
示例2
输入:
["123","123","231","32"],2
复制返回值:
[["123","2"],["231","1"]]
复制说明:
"123"出现了2次,记["123","2"],"231"与"32"各出现1次,但是"231"字典序在"32"前面,记["231","1"],最后返回[["123","2"],["231","1"]]
示例3
输入:
["abcd","abcd","abcd","pwb2","abcd","pwb2","p12"],3
复制返回值:
[["abcd","4"],["pwb2","2"],["p12","1"]]
复制
备注:
1 \leq N \leq 10^51≤N≤105
#
# return topK string
# @param strings string字符串一维数组 strings
# @param k int整型 the k
# @return string字符串二维数组
#
from collections import Counter
class Solution:
def topKstrings(self , strings , k ):
# write code here
dic = Counter(strings)
res = sorted(dic.items(), key=lambda x:(-x[1], x[0]))
res = res[:k]
return res
学习sorted函数和collections模块
sorted:Timesort方法。时间复杂度:O(n) ~ O(nlogn)。空间复杂度O(n)