首页 > itarticle > leetcode 451 sort characters by frequency

leetcode 451 sort characters by frequency

admin 11月 14, 2020 0

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

Example 1:

1
2
3
4
5
6
7
8
9
 
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.

Example 2:

1
2
3
4
5
6
7
8
9
 
Input:
"cccaaa"

Output:
"cccaaa"

Explanation:
Both 'c' and 'a' appear three times, so "aaaccc" is also a valid answer.
Note that "cacaca" is incorrect, as the same characters must be together.

Example 3:

1
2
3
4
5
6
7
8
9
 
Input:
"Aabb"

Output:
"bbAa"

Explanation:
"bbaA" is also a valid answer, but "Aabb" is incorrect.
Note that 'A' and 'a' are treated as two different characters.
  • 非常自然的就想到了用Collections中的Counter来计数
  • Counter中有一个most_common()函数按照出现的次数进行排序
1
2
3
4
5
6
7
8
9
10
11
 
class (object):
    def frequencySort(self, s):
        """
        :type s: str
        :rtype: str
        """
        counter = collections.Counter(s)
        ans = ''
        for (c, n) in counter.most_common():
            ans += c * n
        return ans

微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能