标签：tps app html type strong log and == read
https://leetcode.com/problems/count-and-say/#/description
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.
Sol:
class Solution(object): def countAndSay(self, n): """ :type n: int :rtype: str """ s=‘1‘ for i in range(n-1): count = 1 temp = [] for index in range(1,len(s)): if s[index] == s[index-1]: count += 1 else: temp.append(str(count)) temp.append(s[index-1]) count = 1 temp.append(str(count)) temp.append(s[-1]) s = ‘‘.join(temp) return s
TWO SOLUTIONS IN:
https://discuss.leetcode.com/topic/28084/simple-python-solution/4
.join() in python
http://www.cnblogs.com/jsplyy/p/5634640.html
标签：tps app html type strong log and == read
原文地址：http://www.cnblogs.com/prmlab/p/6953402.html
