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 nth term of the count-and-say sequence.

class Solution {public:    string countAndSay(int n) {    if (n == 0) return string("");        string ret(1, '1');        for (int i = 2; i <= n; ++i) {            string tmp;            size_t size = ret.size();            char ch = ret[0];            size_t count = 1;            for (size_t j = 1; j < size; ++j) {                if (ch == ret[j])                    count++;                else {                    tmp += string(1, '0' + count) + string(1, ch);                    ch = ret[j];                    count = 1;                }            }            tmp += string(1, '0' + count) + string(1, ch);             ret = tmp;        }        return ret;    }};