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 where 1 ≤ n ≤ 30, 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"
My solution:
class Solution:
def countAndSay(self, n):
"""
:type n: int
:rtype: str
"""
if n == 1:
return "1"
if n == 2:
return "11"
count = 1
result = "11"
for i in range(n - 2):
result += "S"
temp = ""
for j in range(len(result) - 1):
if result[j] == result[j + 1]:
count += 1
continue
temp += str(count) + result[j]
count = 1
result = temp
return result
First of all, please focus on case example (input & output)
The key point is "S" (dummy character)
'DataStructure > Strings' 카테고리의 다른 글
Longest Common Prefix (0) | 2018.10.25 |
---|---|
Implement strStr() (0) | 2018.10.23 |
String to Integer (atoi) (0) | 2018.10.23 |
Valid Palindrome (0) | 2018.10.23 |
Valid Anagram (0) | 2018.10.23 |