blob: a9d0e13d84d2c43b769e6b8cc78e7830c66d3a8a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
struct Solution;
impl Solution {
pub fn frequency_sort(s: String) -> String {
let mut map = std::collections::HashMap::with_capacity(26 * 2);
s.chars().for_each(|b| * map.entry(b).or_insert(0) += 1);
let mut v = map.into_iter().map(|(c, n)| (c, n)).collect::<Vec<_>>();
v.sort_unstable_by_key(|pair| - pair.1);
v.into_iter().flat_map(|(c, n)| vec![c; n as usize]).collect()
}
}
fn main() {
let s = String::from("tree");
print!("{}", Solution::frequency_sort(s));
}
|