38. Count and Say【E】【79】【leetcode】

sscssz

于 2016-02-29 20:39:31 发布

阅读量360

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode Python 算法字符串文章标签：字符串 leetcode python

本文链接：https://blog.youkuaiyun.com/sscssz/article/details/50768090

Python 同时被 3 个专栏收录

176 篇文章

订阅专栏

leetcode

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

本文介绍了一种特殊的整数序列——计数并说序列，并提供了一个Python实现的例子。该序列从1开始，后续每一项都是对前一项的描述。例如，1被描述为“一个1”，即11；11被描述为“两个1”，即21。文章通过一个Python类的方法实现了生成指定位置的序列。

摘要生成于 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.

Subscribe to see which companies asked this question

就是简简单单按照这个过程复制一遍

class Solution(object):
    def countAndSay(self, n):
        res = '1'
        for i in xrange(n - 1):
            #print i,res

            cur = res[0]
            count = 1
            t_res = ''
            for j in res[1:]:
                if j == cur:
                    count += 1
                    continue
                else:
                    t_res += str(count) + cur
                    cur = j
                    count = 1
            t_res += str(count) + cur
            #print t_res,'\n'
            res = t_res

        return res