Count and Say

最新推荐文章于 2024-11-04 23:24:03 发布

YT的呼呼

最新推荐文章于 2024-11-04 23:24:03 发布

阅读量157

点赞数

分类专栏：算法文章标签： c++ leetcode 刷题算法

本文链接：https://blog.csdn.net/u012345366/article/details/54379322

版权

算法专栏收录该内容

11 篇文章 0 订阅

订阅专栏

The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 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 n^th sequence.

Note: The sequence of integers will be represented as a string.

水题。思路清楚，没什么难度。代码简单易懂。

class Solution {
public:
    string countAndSay(int n) {
        
        if(n==1){
            return "1";
        }
        string result="1";
        for(int i=2;i<=n;i++){
            result=rever(result);
        }
        return result;
    }
    string rever(string tt){
        string result="";
        int len=tt.length();
        int begin=1;
        for(int i=0;i