1140 Look-and-say Sequence (20point(s)) - C语言 PAT 甲级

1140 Look-and-say Sequence (20point(s))

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

题目大意：

1084 外观数列 (20point(s))

设计思路：

1084 外观数列（C语言）

• 每次利用前一个字符串生成下一个字符串，难点似乎在于如何确定字符数组的大小（实际上，数组大小多提交几次就能知道了(╥﹏╥)）？或者是我未体会到此题的精髓？
• 求大佬解答_(┐「ε:)_

编译器：C (gcc)

#include <stdio.h>

int exterior(char *s1, char *s2);

int main()
{
        char str1[100000] = {0}, str2[100000] = {0};
        int n, i;

        scanf("%s %d", str1, &n);

        for (i = 1; i < n; i++)
                i % 2 ? exterior(str1, str2) : exterior(str2, str1);

        puts(i % 2 ? str1 : str2);

        return 0;
}

int exterior(char *s1, char *s2)
{
        int count = 0;
        while (*s1) {
                count++;
                if (*s1 != *(s1 + 1)) {
                        *s2++ = *s1;
                        *s2++ = count + '0';
                        count = 0;
                }
                s1++;
        }
        return 0;
}