LeetCode | 38. 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"

思路：模拟一遍即可。0ms AC

class Solution {
public:
    string countAndSay(int n) {
        string str = "1";
        for(int i=1;i<n;i++)    //做这么多次操作
        {
            string tmp = "";
            int it = 0;
            int _count = 1;     //记录当前这种字符的个数
            while(it < str.length())
            {
                if(it+1==str.length() || str[it+1]!=str[it])        //当前位和下一位不同，终止计数
                {
                    tmp += (char)(_count+'0');
                    tmp += str[it];
                    _count = 1;
                }
                else
                {
                    _count++;
                }
                it++;
            }
            str = tmp;
        }

        return str;
    }
};