[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 n^th sequence.

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

class Solution {
public:
    /*algorithm
        1-->11-->21-->1211-->111221-->312211-->13112221
        for each step, read string as
        1)continus 1  , len('1..1') + 1
        2)continue 2,  len('2.22') + 2
        ..
    */
    int getCount(string &s,int start){
        char c = s[start];
        int i = start + 1;
        while(i < s.size()){
            if(s[i] != c)break;
            ++i;
        }
        return i - start;
    }
    string countAndSay(int n) {
        string s1;
        if(n < 1)return s1;
        s1 = "1";
        for(int i = 1; i < n;i++)
        {
            int j = 0;
            string s2;
            while(j < s1.size()){
                int cnt = getCount(s1,j);
                s2.append(1,cnt + '0');
                s2.append(1,s1[j]);
                j += cnt;
            }
            s1 = s2;
        }
        return s1;
    }
};