LeetCode38. 外观数列

38. 外观数列

class Solution {
public:
    string countAndSay(int n) {
        if(n < 1) return "";
        string res = "1";
        for(int i = 2; i <= n; i++) {
            res = helper(res);
        }
        return res;
    }
private:   
    string helper(const string& str) {
        string res;
        for(int i = 0; i < str.length(); ) {
            char ch = str[i];
            int num = 0;
            while(i < str.length() && str[i] == ch){
                num++;
                i++;
            }
            res += to_string(num) + ch;
        }
        return res;
    }
};