本来是想写AcWing 771题,结果没看见要求的字符是连续的条件,
写成了找出一个字符串中出现次数最多的元素以及数量
如果形如 mmAA则输出第一个出现的
m 2
要点:python 字典排序
sorted(dict.items(), key=lambda x:x[1], reverse=True)
示例:
输入:
7
aksdbkasbdjsabdjsdasdasd
djasbdkasbdk
asdakjsbdka
ashdbahsbdk
ldnfubgfubgirefeuwihriwuegiubufkbsdhfvsjdhfvsdjfvvhshjgvfgvjgvfjdalskndlk
askdnaskjdnkasjndk dshk fhdsfdf
asdn asod k dash dja shdjash dja sdh d ds hs djash djsah d ashdjsabdjas
输出:
s 6
d 3
a 3
a 2
f 9
d 6
41
N = int(input())
for i in range(N):
str = input()
str_list = list(str)
dict = {k:0 for k in set(str_list)}
for k in str_list:
dict[k] += 1
dict_list = sorted(dict.items(), key=lambda x:x[1], reverse=True)
print(dict_list[0][0], dict_list[0][1])