forked from algorhythms/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path037 Count and Say.py
More file actions
46 lines (39 loc) · 1.29 KB
/
037 Count and Say.py
File metadata and controls
46 lines (39 loc) · 1.29 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
"""
The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 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 sequence.
Note: The sequence of integers will be represented as a string.
"""
__author__ = 'Danyang'
class Solution:
def countAndSay(self, n):
"""
:param n: integer
:return: output representation in string
"""
string = "1"
for i in range(1, n):
string = self.singleCountAndSay(string)
return string
def singleCountAndSay(self, num_string):
"""
Two pointers algorithm: FIND NEXT DIFFERENT
:param num_string: input number as string
:return: output representation as string
"""
string_builder = ""
i = 0
while i<len(num_string):
# find next different number
j = i+1
while j<len(num_string) and num_string[j]==num_string[i]:
j += 1
count = j-i
string_builder += str(count)+str(num_string[i])
i = j
return string_builder
if __name__=="__main__":
print Solution().countAndSay(4)