[LeetCode]Sort Characters By Frequency@Python

Sort Characters By Frequency

Given a string, sort it in decreasing order based on the frequency of characters.

Example

Input:
“tree”

Output:
“eert”

Explanation:
‘e’ appears twice while ‘r’ and ‘t’ both appear once.
So ‘e’ must appear before both ‘r’ and ‘t’. Therefore “eetr” is also a valid answer.

Solution

import collections
class Solution:
    def frequencySort(self, s: str) -> str:
        dic = collections.defaultdict(int)
        for k in s:
            dic[k]+=1
        heap = [(-n, v) for v,n in dic.items()]
        heapq.heapify(heap)
        ret = ''
        while heap:
            n,v = heapq.heappop(heap)
            ret += (-n)*v
        return ret

最后

以上就是内向麦片为你收集整理的[LeetCode]Sort Characters By Frequency@Python的全部内容，希望文章能够帮你解决[LeetCode]Sort Characters By Frequency@Python所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。