PAT-python-1140 Look-and-say Sequence

Look-and-say sequence is a sequence of integers as the following:

D, D1, D111, D113, D11231, D112213111, …
where D is in [0, 9] except 1. The (n+1)st number is a kind of description of the nth number. For example, the 2nd number means that there is one D in the 1st number, and hence it is D1; the 2nd number consists of one D (corresponding to D1) and one 1 (corresponding to 11), therefore the 3rd number is D111; or since the 4th number is D113, it consists of one D, two 1’s, and one 3, so the next number must be D11231. This definition works for D = 1 as well. Now you are supposed to calculate the Nth number in a look-and-say sequence of a given digit D.

Input Specification:
Each input file contains one test case, which gives D (in [0, 9]) and a positive integer N (≤ 40), separated by a space.

Output Specification:
Print in a line the Nth number in a look-and-say sequence of D.

Sample Input:
1 8
Sample Output:
1123123111

解法

这题没啥好说的，直接模拟就行。每次读前一个，所以只记录前一个字符串即可。

def func(s):
    i = 0
    pre = s[0]
    cnt = 0
    ans = ''
    while i < len(s):
        if s[i] == pre:
            cnt += 1
        else:
            ans += pre + str(cnt)
            cnt = 1
            pre = s[i]
        i += 1
    # 最后这个要加上，因为没有字符判断了
    ans += pre + str(cnt)
    return ans


n, m = input().split()
m = int(m)
ans = n
i = 1
while i < m:
    ans = func(ans)
    i += 1
print(ans)