-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCountAndSay_v1.py
More file actions
64 lines (50 loc) · 1.23 KB
/
Copy pathCountAndSay_v1.py
File metadata and controls
64 lines (50 loc) · 1.23 KB
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
62
63
64
'''
38. Count and Say
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"
'''
class Solution:
def countAndSay_v1(self, n):
"""
:type n: int
:rtype: str
"""
s = '1'
for _ in range(n - 1):
let, temp, count = s[0], '', 0
for l in s:
if let == l:
count += 1
else:
temp += str(count) + let
let = l
count = 1
temp += str(count) + let
s = temp
return s
sol = Solution()
print(sol.countAndSay_v1(1))
print(sol.countAndSay_v1(2))
print(sol.countAndSay_v1(3))
print(sol.countAndSay_v1(4))
print(sol.countAndSay_v1(50))
#
# num = '123'
# print(int(num))
# list_A = [int(x) for x in str(num)]
# print(len(list_A))