Leetcode——451. Sort Characters By Frequency

题目原址

https://leetcode.com/problems/sort-characters-by-frequency/description/

题目描述

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

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:

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:

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.

解题思路

给定一个字符串s，将字符串s按照相同元素的个数从大到小一次换序，返回回来。

AC代码

class Solution {
    public String frequencySort(String s) {
        char[] arrs = s.toCharArray();
        //Character用来存储字符串中的字符，Integer用来存储字符出现的个数
        Map<Character,Integer> map = new HashMap<Character,Integer>();
        StringBuilder sb = new StringBuilder();
        int length = arrs.length;
        //遍历字符串
        for(char array: arrs) {
            //将字符串中的字符按照字符为键，存储在map中，值存储当前字符出现的个数
                map.put(array, map.getOrDefault(array, 0) + 1);
        }
        //遍历Map的键值对，使用变量i进行控制字符出现的个数，最多出现的个数为字符串的长度，所以起始值为字符串长度
        for(int i = length; i > 0; i --) {
            //如果map的值即字符出现的个数等于i，则将其添加到sb中，注意要添加i个
                for(char c: map.keySet()) {
                    int j = i; 
                    length -= i;
                    if(map.get(c) == i)
                        while(j > 0){
                            sb.append(c); j --;
                        }
                }
        }
        return sb.toString();        
    }
}