-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathcount-and-say.py
54 lines (40 loc) · 1.36 KB
/
count-and-say.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
class Solution:
def count_and_say_recursion(self, n):
if n == 1:
return "1"
else:
prev_number = self.count_and_say_recursion(n - 1)
result = []
prev_symbol = None
repeat_counter = 0
for symbol in prev_number:
if symbol == prev_symbol:
repeat_counter += 1
result[-1] = str(repeat_counter) + symbol
else:
repeat_counter = 1
result.append(str(repeat_counter) + symbol)
prev_symbol = symbol
return ''.join(result)
def countAndSay(self, n: int) -> str:
result = ["1", ""]
for _ in range(n - 1):
tmp: list[str] = []
prev, reps = "", 0
for char in result:
if char == prev:
reps += 1
else:
if reps > 0:
tmp.extend([str(reps), prev])
prev = char
reps = 1
tmp.append("")
result = tmp
return "".join(result)
solution = Solution()
assert solution.countAndSay(1) == "1"
assert solution.countAndSay(2) == "11"
assert solution.countAndSay(3) == "21"
assert solution.countAndSay(4) == "1211"
assert solution.countAndSay(5) == "111221"