LeetCode-38-Count and Say-E

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 11.
11 is read off as 21.
21 is read off as 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”
解法：（递归的思想）

string countAndSay(int n) {
    if(n==0)
        return "";
    string res="1";
    while(--n){
        string cur = "";
        for(int i=0;i<res.size();i++){
            int count=1;
            while ((i + 1 < res.size()) && (res[i] == res[i + 1])){
                count++;    
                i++;
            }
            cur+=to_string(count)+res[i];
        }
        res=cur;
    }
    return res;
}