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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#![allow(dead_code)]
pub fn frequency_sort(s: String) -> String {
use std::collections::HashMap;
let mut freq = HashMap::new();
for c in s.chars() {
match freq.get_mut(&c) {
Some(v) => {
*v += 1;
}
None => {
freq.insert(c, 1);
}
}
}
let mut res = String::new();
let mut freq = freq.iter().collect::<Vec<_>>();
freq.sort_by(|a, b| (*b).1.partial_cmp((*a).1).unwrap());
freq.iter().for_each(|pair| {
for _ in 0..*pair.1 {
res.push(*pair.0);
}
});
res
}
pub fn frequency_sort2(s: String) -> String {
use std::collections::HashMap;
use std::iter;
let mut freq = HashMap::new();
for c in s.chars() {
match freq.get_mut(&c) {
Some(v) => {
*v += 1;
}
None => {
freq.insert(c, 1);
}
}
}
let mut res = String::new();
let mut counts: Vec<String> = vec![];
counts.resize(s.len() + 1, String::new());
for (c, i) in freq.iter() {
counts[*i].push(*c);
}
for (i, s) in counts.iter().enumerate().rev() {
for c in s.chars() {
res.push_str(&iter::repeat(c).take(i).collect::<String>());
}
}
res
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test1() {
let res = frequency_sort(String::from("tree"));
assert_eq!(
res == String::from("eert") || res == String::from("eetr"),
true
);
}
#[test]
fn test2() {
let res = frequency_sort2(String::from("tree"));
assert_eq!(
res == String::from("eert") || res == String::from("eetr"),
true
);
assert_eq!(
frequency_sort2(String::from("eeeee")),
String::from("eeeee")
);
}
}