[Leetcode]Count and Say

最新推荐文章于 2019-08-14 16:27:56 发布

NoooName

最新推荐文章于 2019-08-14 16:27:56 发布

阅读量305

点赞数

分类专栏： Array 文章标签： leetcode python

本文链接：https://blog.csdn.net/NoooName/article/details/43488403

版权

Array 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

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.

求序列的第N项~对于当前项，计数并生成下一项

class Solution:
    # @return a string
    def countAndSay(self, n):
        if n <= 0: return ""
        num = '1'
        for i in xrange(n - 1):
            count = 1; cur = ''
            for j in xrange(1, len(num)):
                if num[j] == num[j - 1]:
                    count += 1
                else:
                    cur += str(count) + num[j - 1]
                    count = 1
            cur += str(count) + num[-1]
            num = cur
        return num