[leetcode]38. Count and Say

最新推荐文章于 2023-06-09 10:21:32 发布

xiaocong1990

最新推荐文章于 2023-06-09 10:21:32 发布

阅读量257

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/xiaocong1990/article/details/53107851

leetcode 专栏收录该内容

473 篇文章

订阅专栏

本文介绍了一种特殊的整数序列——计数与说数序列，并提供了一个C++实现方案来生成该序列的第n项。通过解析序列规则，文章中的代码能够逐位读取前一项中的数字并统计出现次数，从而构造出下一项。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：https://leetcode.com/problems/count-and-say/

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 nth sequence.

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

class Solution {
public:
    string countAndSay(int n)
    {
        string currRes="";
        if(n<=0)
            return currRes;
        string preRes="1";
        if(n==1)
            return preRes;
        for(int i=1;i<n;i++)
        {
        
            char tmp=preRes[0];
            int times=1;
            for(int j=1;j<preRes.size();j++)
            {
                if(preRes[j]==tmp)
                    times++;
                else
                {
                    currRes+=to_string(times);
                    
                    currRes.push_back(tmp);
                    tmp=preRes[j];
                    times=1;
                }
            }
            currRes+=to_string(times);
            
            currRes.push_back(tmp);
            preRes=currRes;
            currRes="";
        }
        return preRes;
    }


};