LEETCODE: Count and Say

停止更新+1

于 2014-12-16 17:42:03 发布

阅读量277

点赞数

CC 4.0 BY-SA版权

文章标签： LEETCODE 算法

本文链接：https://blog.youkuaiyun.com/anyicheng2015/article/details/41963485

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一种特殊的整数序列——计数与描述序列，并提供了一个C++实现方案来生成该序列的第n项。通过不断迭代和读取前一项的数字模式，算法能够高效地构建出目标序列。

摘要生成于 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 pre = "1";
      for(int ii = 2; ii <= n; ii ++) {
         string current;
         for(int jj = 0; jj < pre.length(); jj ++) {
            int kk = jj;
            while(kk + 1 < pre.length() && pre[kk] == pre[kk + 1]) {
               kk ++;
            }
            current += '0' + (kk - jj + 1);
            current += pre[jj];
            jj = kk;
         }
         pre = current;
      }

      return pre;
    }
};