LeetCode--Count and Say
来源:互联网 发布:搞怪的淘宝收件人名字 编辑:程序博客网 时间:2024/06/06 16:51
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) { string str; string tmp = "1"; for(int i=0; i<n-1; i++) { str = tmp; tmp = ""; int size = str.size(); int len = 1; for(int j=0; j<size; j++) { if(str[j+1] == str[j]) len++; else { tmp += '0' + len; tmp += str[j]; len = 1; } } } return tmp; }};
0 0
- LeetCode: Count and Say
- [LeetCode]Count and Say
- LeetCode Count and Say
- [Leetcode] Count and Say
- Leetcode: Count and Say
- [LeetCode] Count and Say
- LeetCode Count and Say
- [LeetCode]Count and Say
- [LeetCode] Count and Say
- LeetCode-Count and Say
- LeetCode: Count and Say
- LeetCode - Count and Say
- [LeetCode] Count and Say
- Count and Say 【leetcode】
- [LeetCode] Count and Say
- Leetcode Count and Say
- LeetCode Count and Say
- LeetCode | Count and Say
- 第2周 阅读程序-初识对象(二)
- 【高效算法设计——双向扫描】 UVa 1442 Cave
- hdu 1062 Text Reverse 字符串处理。简单水题
- Rotate Array
- 项目一 用“类”解决旱冰场造价的问题
- LeetCode--Count and Say
- 把书读薄之《面向对象葵花宝典》阅读笔记-面向对象基础
- 微博系统,集成新浪开发,有需要的朋友下载
- auto keyword demo
- WCF 入门教程二
- Valentine's Day Round 1001 Ferries Wheel
- 康托展开
- 第二学期 第一周项目一 初识对象阅读材料回答问题
- 交换两个变量的值,不使用第三个变量的四种方法