-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path451.py
38 lines (30 loc) · 960 Bytes
/
451.py
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
# [ LeetCode ] 451. Sort Characters By Frequency
def solution(s: str) -> str:
from collections import defaultdict
answer: str = ""
letters_count: dict[str, int] = defaultdict(int)
for letter in s:
letters_count[letter] += 1
sorted_letters_count: list[tuple[str, int]] = sorted(
letters_count.items(), key=lambda entry: entry[1], reverse=True
)
for letter, count in sorted_letters_count:
answer += (letter * count)
return answer
if __name__ == "__main__":
cases: list[dict[str, dict[str, str] | str]] = [
{
"input": {"s": "tree"},
"output": "eetr"
},
{
"input": {"s": "cccaaa"},
"output": "cccaaa"
},
{
"input": {"s": "Aabb"},
"output": "bbAa"
}
]
for case in cases:
assert case["output"] == solution(**case["input"])