利用了python sorted函数的稳定性,即不改变排序前列表中元素本来的顺序 string=input() uniq=[] for i in string: if i not in uniq: uniq.append(i) uniq.sort() times=[] for i in uniq: times.append(string.count(i)) ans=[] for i in range(len(uniq)): ans.append((uniq[i],times[i])) ans=sorted(ans,key=lambda x:x[1],re...