leetcode: 38. Count and Say
来源:互联网 发布:萨姆鲍维实力.知乎 编辑:程序博客网 时间:2024/06/05 20:41
Q
The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 1112211 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 term of the count-and-say sequence.
Note:
Each term of the sequence of integers will be represented as a string.
Example 1:
Input: 1Output: "1"
Example 2:
Input: 4Output: "1211"
AC
class Solution(object): def countAndSay(self, n): """ :type n: int :rtype: str """ s = '1' for _ in xrange(n-1): tmp, count = [], 1 for idx in xrange(1, len(s)): if s[idx] == s[idx-1]: count += 1 else: tmp.append(str(count)+s[idx-1]) count = 1 tmp.append(str(count)+s[-1]) s = ''.join(tmp) return sif __name__ == "__main__": assert Solution().countAndSay(1) == '1' assert Solution().countAndSay(2) == '11' assert Solution().countAndSay(3) == '21' assert Solution().countAndSay(4) == '1211' assert Solution().countAndSay(5) == '111221' assert Solution().countAndSay(6) == '312211'
阅读全文
0 0
- [LeetCode]38.Count and Say
- LeetCode --- 38. Count and Say
- LeetCode 38.Count and Say
- [Leetcode] 38. Count and Say
- 38. Count and Say LeetCode
- Leetcode 38. Count and Say
- leetcode 38. Count and Say
- [leetcode] 38. Count and Say
- LeetCode-38.Count and Say
- LeetCode *** 38. Count and Say
- leetcode 38. Count and Say
- LeetCode-38. Count and Say
- LeetCode 38. Count and Say
- LeetCode 38. Count and Say
- Leetcode - 38. Count and Say
- LeetCode 38. Count and Say
- Leetcode 38. Count and Say
- LeetCode 38. Count and Say
- 7-18 寻找大富翁(25 分) (堆排序)
- qt pro文件和pri文件的区别
- 【第六届蓝桥杯】串逐位和
- 微信小程序常见问题
- 微信自定义菜单开发案例
- leetcode: 38. Count and Say
- div不可编辑的问题
- 全选与反选
- 7-19 PAT Judge(25 分)(结构体排序)
- 【深度相机系列三】深度相机原理揭秘--双目立体视觉
- 《大话设计模式》java实现之原型模式
- CentOS版Linux获取IP
- 活在当下
- dubbo入门示例