-
Notifications
You must be signed in to change notification settings - Fork 20
/
CountAndSay.py
executable file
·61 lines (55 loc) · 1.43 KB
/
CountAndSay.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
57
58
59
60
61
# -*- coding: UTF-8 -*-
#
#
# The count-and-say sequence is the sequence of integers with the first five terms as following:
#
# 1. 1
# 2. 11
# 3. 21
# 4. 1211
# 5. 111221
# 1 is read off as "one 1" or 11.
# 11 is read off as "two 1s" or 21.
# 21 is read off as "one 2, then one 1" or 1211.
# Given an integer n, generate the nth term of the count-and-say sequence.
#
# Note: Each term of the sequence of integers will be represented as a string.
#
# Example 1:
#
# Input: 1
# Output: "1"
# Example 2:
#
# Input: 4
# Output: "1211"
#
# Python, Python 3 all accepted.
class CountAndSay:
def countAndSay(self, n):
"""
:type n: int
:rtype: str
"""
if n <= 0:
return "0"
if n == 1:
return "1"
result = []
chars = list(self.countAndSay(n - 1))
i = 0
while i < len(chars) - 1:
count = 1
while i + 1 < len(chars) and chars[i] == chars[i + 1]:
count += 1
i += 1
result.append(str(count))
result.append(chars[i])
i += 1
if len(chars) - 2 >= 0 and chars[len(chars) - 1] == chars[len(chars) - 2]:
result_length = len(result)
result[result_length - 2] = str(int(result[result_length - 2]))
else:
result.append(chars[len(chars) - 1])
result.append("1")
return ''.join(result)