leetcode451. Sort Characters By Frequency

feng409 发布于2019-08-16 18:40 / 2758人阅读

摘要：题目要求将字符串按照每个字母出现的次数，按照出现次数越多的字母组成的子字符串越靠前，生成一个新的字符串。这里要注意大小写敏感。以此循环，直到将所有的字母都输出。

题目要求

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.

将字符串按照每个字母出现的次数，按照出现次数越多的字母组成的子字符串越靠前，生成一个新的字符串。这里要注意大小写敏感。

思路和代码

直观的来说，如果可以记录每个字母出现的次数，再按照字母出现的次数从大到小对字母进行排序，然后顺序构成一个新的字符串即可。这里采用流的方式进行排序，代码如下：

    public String frequencySort(String s) {
        if(s==null || s.isEmpty() || s.length() <= 1) return s;
        Map map = new HashMap<>();
        for(char c : s.toCharArray()) {
            map.put(c, map.getOrDefault(c, new StringBuilder()).append(c));
        }
        StringBuilder result = map
                .values()
                .stream()
                .sorted((sb1, sb2) -> {
                    return sb2.length() - sb1.length();
                })
                .reduce((sb1, sb2) -> sb1.append(sb2))
                .get();
        return result.toString();
    }

如果不直观的进行排序的话，则每次只要从记录字母出现次数的map中找出出现次数最多的字母，将其输出，并再次从剩下的字母中选出次数最多的字母。以此循环，直到将所有的字母都输出。代码如下：

    public String frequencySort(String s) {
        char[] charArr = new char[128];
        
        
        for(char c :  s.toCharArray()) 
            charArr[c]++;
        
        StringBuilder sb = new StringBuilder();

        
        while(sb.length() < s.length()) {
                    char maxChar = 0;
            for(char charCur = 0; charCur < charArr.length; charCur++) {
                
                if(charArr[charCur] > charArr[maxChar]) {
                    maxChar = charCur;
                }
            }
            while(charArr[maxChar] > 0){
                sb.append(maxChar);
                charArr[maxChar]--;
            }
           
        }
        
        return sb.toString();
    }

私有云服务器托管 Frequency Characters Leetcod LeetCode

文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。

转载请注明本文地址：https://www.ucloud.cn/yun/75556.html

[LeetCode] 451. Sort Characters By Frequency

Problem 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 app...

Pluser 2019-08-19 11:14 评论0 收藏0
451. Sort Characters By Frequency

451. Sort Characters By Frequency 题目链接：https://leetcode.com/problems... hashmap求frequency加排序，排序可以用bucket sort or heap sort。 bucket sort： public class Solution { public String frequencySort(String ...

changfeng1050 2019-08-14 17:28 评论0 收藏0
358. Rearrange String k Distance Apart

摘要：题目链接的思想，这题要让相同字母的距离至少为，那么首先要统计字母出现的次数，然后根据出现的次数来对字母排位置。出现次数最多的肯定要先往前面的位置排，这样才能尽可能的满足题目的要求。 358. Rearrange String k Distance Apart 题目链接：https://leetcode.com/problems... greedy的思想，这题要让相同字母的charact...

Taonce 2019-08-14 17:35 评论0 收藏0
[LeetCode] 158. Read N Characters Given Read4 II -

Problem The API: int read4(char *buf) reads 4 characters at a time from a file. The return value is the actual number of characters read. For example, it returns 3 if there is only 3 characters left i...

周国辉 2019-08-16 13:48 评论0 收藏0
leetcode443. String Compression

摘要：题目要求对字符串进行简单的压缩操作，压缩的规则是，如果出现多个重复的字母，则用字母加上字母出现的字数进行表示。如果字母只出现一次，则不记录次数。题目要求 Given an array of characters, compress it in-place. The length after compression must always be smaller than or equ...

nifhlheimr 2019-08-16 16:41 评论0 收藏0