「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

---

Ω

字符串迭代，每次迭代的规则，是将原字符串中的连续子串“xx…x”替换为“xn”，n表示最长连续子串中x的个数。那么只需遍历字符串，若当前字符与前一个字符不同，就把前一个字符与cnt加到结果字符串中，同时将计数器cnt归1，若相同则++cnt。

---

🐎

#include <iostream>

using namespace std;

int main()
{
    string ans, nxt;
    int n, cnt = 1;
    cin >> ans >> n;
    for (int i = 1; i < n; ++i, cnt = 1)
    {
        for (int j = 1; j < ans.size(); ++j)
        {
            if (ans[j] != ans[j - 1])
                nxt += string(1, ans[j - 1]) + to_string(cnt), cnt = 1;
            else ++cnt;
        }
        nxt += string(1, ans.back()) + to_string(cnt);
        ans = std::move(nxt), nxt = "";
    }
    cout << ans;
}