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

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