LEETCODE-Count and Say

最新推荐文章于 2018-07-04 07:19:52 发布

原创最新推荐文章于 2018-07-04 07:19:52 发布 · 273 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

137 篇文章

订阅专栏

本文介绍了一种生成计数读数序列的方法，通过迭代构建序列。从初始序列1开始，每一步根据前一个序列生成新的序列。例如，1被读作“one 1”即11，11被读作“two 1s”即21等。

摘要生成于 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) {
       n = n - 1;
        string S = "1";
    string fakeS = "";
    for (int i = 0; i < n; i++) {
        int len = S.size();
        int count = 0;
        char model = S[0];
        for (int j = 0; j < len; j++) {
            if (S[j] == model)
                count++;
            else {
                char tmp = count + '0';
                fakeS = fakeS + tmp + model;
                model = S[j];
                count = 1;
            }

            if (j == len - 1) {
                char tmp = count + '0';
                fakeS = fakeS + tmp + model;
            }
        }
            S = fakeS;
        fakeS = "";
    }
    return S;
    }
};