-
-
Notifications
You must be signed in to change notification settings - Fork 8.9k
/
Copy pathSolution.java
28 lines (28 loc) · 961 Bytes
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
class Solution {
public String frequencySort(String s) {
Map<Character, Integer> counter = new HashMap<>();
for (char c : s.toCharArray()) {
counter.put(c, counter.getOrDefault(c, 0) + 1);
}
List<Character>[] buckets = new List[s.length() + 1];
for (Map.Entry<Character, Integer> entry : counter.entrySet()) {
char c = entry.getKey();
int freq = entry.getValue();
if (buckets[freq] == null) {
buckets[freq] = new ArrayList<>();
}
buckets[freq].add(c);
}
StringBuilder sb = new StringBuilder();
for (int i = s.length(); i >= 0; --i) {
if (buckets[i] != null) {
for (char c : buckets[i]) {
for (int j = 0; j < i; ++j) {
sb.append(c);
}
}
}
}
return sb.toString();
}
}