码迷,mamicode.com
首页 > 编程语言 > 详细

[leetcode] Count and Say @ Python

时间:2014-09-30 07:48:12      阅读:193      评论:0      收藏:0      [点我收藏+]

标签:style   blog   color   io   ar   for   sp   div   c   

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.

 

Code:

class Solution:
    # @return a string
    def countAndSay(self, n):
        #思路:遍历,每次对前面的string进行分析,输出
        s= 1
        for i in range(n-1):
            prev = newS =‘‘
            num = 0
            for curr in s:
                if prev !=‘‘ and prev != curr:
                    newS += str(num) + prev  # how many times the value "prev" appears
                    num = 1
                else:
                    num += 1
                prev = curr
            newS += str(num) + prev
            s = newS
        return s

 

[leetcode] Count and Say @ Python

标签:style   blog   color   io   ar   for   sp   div   c   

原文地址:http://www.cnblogs.com/asrman/p/4001268.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!