Leetcode 38. Count and Say

版权声明:博客文章都是作者辛苦整理的,转载请注明出处,谢谢! https://blog.csdn.net/Quincuntial/article/details/82986634

文章作者: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;
    }
};

Reference

  1. https://leetcode.com/problems/count-and-say/description/

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

扫码关注云+社区

领取腾讯云代金券