摘要:題目要求將字符串按照每個字母出現的次數,按照出現次數越多的字母組成的子字符串越靠前,生成一個新的字符串。這里要注意大小寫敏感。以此循環,直到將所有的字母都輸出。
題目要求
</>復制代碼
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();
}
文章版權歸作者所有,未經允許請勿轉載,若此文章存在違規行為,您可以聯系管理員刪除。
轉載請注明本文地址:http://m.specialneedsforspecialkids.com/yun/75556.html
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...
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 ...
摘要:題目鏈接的思想,這題要讓相同字母的距離至少為,那么首先要統計字母出現的次數,然后根據出現的次數來對字母排位置。出現次數最多的肯定要先往前面的位置排,這樣才能盡可能的滿足題目的要求。 358. Rearrange String k Distance Apart 題目鏈接:https://leetcode.com/problems... greedy的思想,這題要讓相同字母的charact...
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...
摘要:題目要求對字符串進行簡單的壓縮操作,壓縮的規則是,如果出現多個重復的字母,則用字母加上字母出現的字數進行表示。如果字母只出現一次,則不記錄次數。 題目要求 Given an array of characters, compress it in-place. The length after compression must always be smaller than or equ...
閱讀 2525·2023-04-25 17:27
閱讀 1837·2019-08-30 15:54
閱讀 2378·2019-08-30 13:06
閱讀 2991·2019-08-30 11:04
閱讀 760·2019-08-29 15:30
閱讀 737·2019-08-29 15:16
閱讀 1742·2019-08-26 10:10
閱讀 3614·2019-08-23 17:02