leetcode---Count and Say

The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 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 sequence.

Note: The sequence of integers will be represented as a string.

class Solution {
public:
    string solve(string s)  //返回s中的计数字符串
    {
        int len = s.length();
        char last = s[0];
        int count = 1;
        string result;
        int i = 1;
        while(i<len)
        {
            if(s[i] == last)
            {
               count++;
               i++;
            }
            else
            {
                char tmp = count + '0';
                result = result + tmp + last;
                last = s[i];
                count = 1;
                i++;
            }
        }
        char tmp = count + '0';
        result = result + tmp + last;
        return result;
    }

    string countAndSay(int n) 
    {
        string result = "1";
        for(int i=1; i<n; i++)
            result = solve(result);
        return result;
    }
};