[LeetCode]Sort Characters By Frequency@Python

最新推荐文章于 2024-09-14 18:52:56 发布

Goofiness

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量132

点赞数

分类专栏： heap leetcode 文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/90147262

版权

leetcode 同时被 2 个专栏收录

232 篇文章 0 订阅

订阅专栏

heap

10 篇文章 0 订阅

订阅专栏

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