Leetcode 38. Count and Say

Tyan

发布于 2019-05-25 22:55:56

3060

发布于 2019-05-25 22:55:56

文章被收录于专栏：SnailTyanSnailTyan

文章作者：Tyan

博客：noahsnail.com | CSDN | 简书

1. Description

2. Solution

class Solution {
public:
    string countAndSay(int n) {
        if(n == 1) {
            return "1";
        }
        string result;
        string current = "1";
        for(int i = 1; i < n; i++) {
            result = statistic(current);
            current = result;
        }
        return result;
    }

private:
    string statistic(string s) {
        string result;
        int count = 1;
        char current = s[0];
        for(int i = 1; i < s.length(); i++) {
            if(current == s[i]) {
                count++;
            }
            else {
                result = result + to_string(count) + current;
                current = s[i];
                count = 1;
            }
        }
        return result + to_string(count) + current;
    }
};