Count and Say--LeetCode

1.题目

Count and Say

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, 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”

2.题意

如示例所述

3.分析

对于前一个数，找出相同元素的个数，把个数和该元素存到新的string里，第一个数为1
注意一定不要把cur += to_string(cnt) + res[i];写成cur = to_string(cnt) + res[i];

4.代码

class Solution {
public:
    string countAndSay(int n) {
        if(n < 0)
            return "";

        string res = "1";
        for(int k = 2; k <= n; ++k)
        {
            string cur = "";
            for(int i = 0; i < res.size(); ++i)
            {
                int cnt = 1;

                while(i + 1 < res.size() && res[i] == res[i + 1])
                {
                    ++cnt;
                    ++i;
                }

                cur += to_string(cnt) + res[i];
            }

            res = cur;
        }

        return res;
    }
};