Leecode- 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"

class Solution {
public:
    string countAndSay(int n) {
        if (n <= 0)
            return NULL;
        if(n==1)
        {
            return "1";
        }
        string ResString;
        string BufString="1";
        for(int i=1;i<n;i++)
        {
            BufString=Count(BufString);
        }
        ResString=BufString;
        return ResString;
        
    }
    
    string Count(const string &str)
    {
        int size = strlen(str.c_str());
        //保存结果
        stringstream ret;
        //保存标识字符
        char flag = str[0];
        //计算标识字符的出现次数
        int count = 0 , i = 0;
        for(int i=0;i<size;i++)
        {
            //临时循环位
            int pos = i;
            while (str[pos] == flag)
            {
                count++;
                pos++;
            }//while
            ret << count << flag; //steamstring
            flag = str[pos];
            count = 0;
            //设置下一个循环位
            i = pos;
        }//for
        return ret.str();
    }
    
};