<strike id="kmemm"></strike>

<abbr id="kmemm"></abbr>

<ul id="kmemm"></ul>

[LeetCode] 451. Sort Characters By Frequency

Pluser 發(fā)布于2019-08-19 11:14 / 2772人閱讀

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

Solution

class Solution {
    public String frequencySort(String s) {
        Map map = new HashMap<>();
        for (int i = 0; i < s.length(); i++) {
            map.put(s.charAt(i), map.getOrDefault(s.charAt(i), 0)+1);
        }
        
        PriorityQueue> queue = new PriorityQueue<>((a, b)->b.getValue()-a.getValue());
        queue.addAll(map.entrySet());
        
        StringBuilder sb = new StringBuilder();
        while (!queue.isEmpty()) {
            Map.Entry entry = queue.poll();
            for (int i = 0; i < (int)entry.getValue(); i++) sb.append(entry.getKey());
        }
        
        return sb.toString();
    }
}

Bucket Sort

class Solution {
    public String frequencySort(String s) {
        Map map = new HashMap<>();
        for (int i = 0; i < s.length(); i++) {
            map.put(s.charAt(i), map.getOrDefault(s.charAt(i), 0)+1);
        }
        
        List[] buckets = new ArrayList[s.length()+1];
        for (Map.Entry entry: map.entrySet()) {
            int i = entry.getValue();
            if (buckets[i] == null) buckets[i] = new ArrayList<>();
            buckets[i].add(entry.getKey());
        }
        StringBuilder sb = new StringBuilder();
        for (int i = s.length(); i >= 0; i--) {
            if (buckets[i] != null && buckets[i].size() > 0) {
                for (Character ch: buckets[i]) {
                    for (int j = i; j > 0; j--) sb.append(ch);
                }
            }
        }
        return sb.toString();
    }
}

GPU云服務器云服務器 Frequency Characters LeetCode LeetCode_String

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/77242.html

leetcode451. Sort Characters By Frequency

摘要：題目要求將字符串按照每個字母出現(xiàn)的次數(shù)，按照出現(xiàn)次數(shù)越多的字母組成的子字符串越靠前，生成一個新的字符串。這里要注意大小寫敏感。以此循環(huán)，直到將所有的字母都輸出。題目要求 Given a string, sort it in decreasing order based on the frequency of characters. Example 1: Input: tree ...

feng409 2019-08-16 18:40 評論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

摘要：題目鏈接的思想，這題要讓相同字母的距離至少為，那么首先要統(tǒng)計字母出現(xiàn)的次數(shù)，然后根據(jù)出現(xiàn)的次數(shù)來對字母排位置。出現(xiàn)次數(shù)最多的肯定要先往前面的位置排，這樣才能盡可能的滿足題目的要求。 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

摘要：題目要求對字符串進行簡單的壓縮操作，壓縮的規(guī)則是，如果出現(xiàn)多個重復的字母，則用字母加上字母出現(xiàn)的字數(shù)進行表示。如果字母只出現(xiàn)一次，則不記錄次數(shù)。題目要求 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