Count and Say
来源:互联网 发布:中锐网络股份有限公司 编辑:程序博客网 时间:2024/05/13 22:46
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 countAndSay(int n) {if (n <= 0) return "";int count = 1;string res("1");while (count < n){string tmp;char pre = '0';int num = 0;for (int i = 0; i < res.size(); i++){if (res[i] == pre)num++;else{if (pre != '0'){tmp.push_back(num + '0');tmp.push_back(pre);}pre = res[i];num = 1;}}tmp.push_back(num + '0');tmp.push_back(pre);res = tmp;count++;}return res; }};
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++实现的字符串模糊匹配
- JavaScript编写类
- 谈谈架构师的职责(一)
- ORACLE 异常处理
- 【Java语法与C语言的区别】一
- Count and Say
- oracle SQL优化实战经验
- 用hadoop实现SimRank++算法(1)----权值转移矩阵的计算
- 黑马程序员_java的网络学习一_05
- cvSeq的学习
- MIT differential equation---1
- JAVA IO总结
- linux基础知识
- Binary Tree Inorder Traversal