【Leetcode】38.外观数列

1.题目描述

题目原链接：count-and-say

2.解题思路及算法

• 采用递归，逐层求解
• 使用循环遍历字符串，进行描述

class Solution {
public:
    string countAndSay(int n) {
        if (n == 1) 
            return "1";
        string pre =  countAndSay(n-1);
        string rec = "";
        int i = 0,count=1;
        for (i;i < pre.length();i++){
            if(pre[i] == pre[i+1]){
                count++;
            }else{
                rec = rec + to_string(count) + pre[i];
                count = 1;
            }
        }
        return rec;
    }
};