forked from ngiengkianyew/daily-coding-problem
-
Notifications
You must be signed in to change notification settings - Fork 1
/
problem_359.py
56 lines (42 loc) · 1.2 KB
/
problem_359.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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
WORD_MAP = {
0: "zero",
1: "one",
2: "two",
3: "three",
4: "four",
5: "five",
6: "six",
7: "seven",
8: "eight",
9: "nine",
}
def get_char_count_dict(string):
letter_dict = dict()
for char in string:
if char not in letter_dict:
letter_dict[char] = 0
letter_dict[char] += 1
return letter_dict
def use_digit(letter_dict, word_dict, digit):
for char in word_dict:
if char not in letter_dict or word_dict[char] > letter_dict[char]:
return letter_dict, 0
for char in word_dict:
letter_dict[char] -= word_dict[char]
letter_dict, uses = use_digit(letter_dict, word_dict, digit)
return letter_dict, uses + 1
def get_sorted_nums(string):
letter_dict = get_char_count_dict(string)
result = 0
for i in range(10):
word = WORD_MAP[i]
word_dict = get_char_count_dict(word)
letter_dict, uses = use_digit(letter_dict, word_dict, i)
while uses > 0:
result = result * 10 + i
uses -= 1
return result
# Tests
assert get_sorted_nums("niesevehrtfeev") == 357
assert get_sorted_nums("nienienn") == 99
assert get_sorted_nums("enieniennon") == 199