Count and Say
来源:互联网 发布:单片机dl是什么意思啊 编辑:程序博客网 时间:2024/04/29 11:43
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.
思路:题目很简单,看清题意,代码如下:
class Solution {public: string countAndSayOnce(string s){ string ret = ""; int i = 0, len = s.length(); while(i++ < len){ int count = 1; while(i < len && s[i] == s[i - 1]){ count ++; i++; } ret += count + '0'; ret += s[i - 1]; } return ret; } string countAndSay(int n) { string s = "1"; for(int i = 0; i < n - 1; ++i) s = countAndSayOnce(s); return s; }};
0 0
- LeetCode: Count and Say
- [LeetCode]Count and Say
- LeetCode Count and Say
- [Leetcode] Count and Say
- Count and Say
- Leetcode: Count and Say
- [LeetCode] Count and Say
- LeetCode Count and Say
- Count and Say
- [38]Count and Say
- Count and Say
- Count and Say
- Count and Say
- [LeetCode]Count and Say
- Count and Say
- Count and Say
- [LeetCode] Count and Say
- LeetCode-Count and Say
- 如何撰写商业计划书(精简)
- C++Primer第五版 10.2.2节练习
- easyui+rest服务,ajax请求session过期不跳转问题解决
- android学习:android Activity生命周期的七个方法测试
- 短信发送
- Count and Say
- 设计模式 装饰者模式
- 线索化中序、先序、后序遍历二叉树的方式(待补充完整)
- USACO Section 1.4 More Search Technique
- WebService之Axis2系列教程Axis2与Spring集成发布
- iOS 中关于copy和mutable copy的理解
- socket编程原理
- php实现验证码
- Android 6.0 权限模型——Permissions