LeetCode--Count and Say

最新推荐文章于 2020-05-22 21:00:47 发布

原创最新推荐文章于 2020-05-22 21:00:47 发布 · 455 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

14 篇文章

订阅专栏

本文详细介绍了如何实现计数与说法序列算法，并通过实例展示了其核心逻辑和运行过程，旨在帮助读者理解并掌握这一算法的基本原理。

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

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 str;
        string tmp = "1";
        
        for(int i=0; i<n-1; i++)
        {
            str = tmp;
            tmp = "";
            int size = str.size();
            int len = 1;
            
            for(int j=0; j<size; j++)
            {
                if(str[j+1] == str[j])
                    len++;
                else
                {
                    tmp += '0' + len;
                    tmp += str[j];
                    len = 1;
                }
            }
        }
        return tmp;
        
    }
};