题目:
A magical string S consists of only '1' and '2' and obeys the following rules:
The string S is magical because concatenating the number of contiguous occurrences of characters '1' and '2' generates the string S itself.
The first few elements of string S is the following: S = "1221121221221121122……"
If we group the consecutive '1's and '2's in S, it will be:
1 22 11 2 1 22 1 22 11 2 11 22 ......
and the occurrences of '1's or '2's in each group are:
1 2 2 1 1 2 1 2 2 1 2 2 ......
You can see that the occurrence sequence above is the S itself.
Given an integer N as input, return the number of '1's in the first N number in the magical string S.
Note: N will not exceed 100,000.
Example 1:
Input: 6 Output: 3 Explanation: The first 6 elements of magical string S is "12211" and it contains three 1's, so return 3.
规律:
初始串为122,之后第i位的数字表示字符串后面需要添加的数字的个数,而当前字符串的末尾数字的相反数,即为要添加的数字。
代码:
class Solution(object):
def magicalString(self, n):
"""
:type n: int
:rtype: int
"""
if n <= 0 :
return 0
else :
if n <= 3 :
return 1
else :
lis = [1,2,2] //初始串
res = 1 //初始1的个数
i = 2 //初始i的位置
while i < n :
if lis[i] == 1 : //字符串需要添加一个数字
if lis[-1] == 1: //如果末位为1,则字符串后应该添加2
lis.append(2)
else :
lis.append(1) //否则,应该添加1
else : //如果当前位置i对应的数字为2,则需要在字符串末尾添加两个数字
if lis[-1] == 1:
lis.append(2)
lis.append(2)
else :
lis.append(1)
lis.append(1)
i += 1
if i < n : // 判断返回结果是否需要增加
if lis[i] == 1 :
res += 1
return res