38. Count and Say
来源:互联网 发布:apache java 编辑:程序博客网 时间:2024/05/20 08:00
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.
好多人理解不动题目?unbelievable!
class Solution {public: string countAndSay(int n) { string first = "1"; string next; while(n - 1){//也可以这样写 while( --n) next = "";// 这句话容易忘 for(int i = 0; i < first.size(); ){ char c = first[i]; int len = 0; while(i + len < first.size() && first[i + len] == c) len++; i += len; next.push_back('0' + len);//也可以这样写 cur += to_string(count) + res[i]; next.push_back(c); } first = next; n--; } return first; }};
0 0
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 38. Count and Say
- 如何在xcode simulator保存完整的横屏图片
- 关于linux 执行权限的理解
- CentOS7下安装postgresql9.3+
- Framework中的连接管理机制(转载)
- [大数据]Hadoop 2.7.3 和Hbase 1.2.4安装教程
- 38. Count and Say
- 阿里云和腾讯云,最终谁会成为中国的AWS?
- jsp&thymeleaf双视图应用
- J2EE13个技术点
- 二叉搜索(排序)树
- Oracle VM VirtualBox 安装 centos7后,centos7解决办法
- Android性能优化总结
- dom4j 最常用最简单的用法(转)
- Grizzly 2.2发布,开源Java NIO框架