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”

本题是将数字从1开始，将当前数字转化为口语对应的数字。比如1口语是1个1，记作11；11读作2个1，记作21；21读作1个2，1个1，记作1211……

　　‘1’是第一个数字，根据输入的数字n，计算第n个这样的数字。

　　说起来比较拗口，对照着例子可以感受一下……

#include "CountAndSay.h"

string CountAndSay::countAndSay(int n)
{
    string ret = "1";
    for (int i = 1; i < n; i++)
    {
        //迭代n-1次
        ret = getNextStr(ret);
    }

    return ret;
}

string CountAndSay::getNextStr(string str)
{
    string tmp = "";
    char curChar = str[0];
    int charNum = 0;
    int i = 0;
    while (i <= str.length())
    {
        if (str[i] && curChar == str[i])
        {
            charNum++;
        }
        else if (charNum != 0)
        {
            tmp += to_string(charNum) + curChar;
            curChar = str[i];
            charNum = 1;//初始化
        }
        i++;
    }
    return tmp;
}