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 n^th 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"

解决方法：

很有意思的一道题，有意思在于你得明白题意是什么。反正我是看了半天才知道它问的是啥。

用递归和循环都可以求解，建议不需要递归的就不递归了。循环用起来清晰简单速度快。

代码：

string countAndSay(int n) {
        if (n < 1)
            return "";
        
        string res = "1";
        
        while(--n){
            string temp = "";
            int count = 1;    
            char ch = res[0];
            for(int i = 1; i < res.size(); i++){
                if (ch != res[i]){
                    temp += to_string(count) + ch;
                    count = 1, ch = res[i];
                }else{
                    ++count;
                }
            }
            
            temp += to_string(count) + ch;
            
            res = temp;
        }
        
        return res;
    }