LeetCode(38) Count and Say
2015-08-26 11:14
399 查看
题目
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.
分析
这是一道根据规则推导题目,要求给定序列数n,求出该序列对应的字符串。规则如上图所示。
AC代码
class Solution { public: string countAndSay(int n) { if (n <= 0) return NULL; //n=1时,结果为"1" string ret = "1"; if (n == 1) return ret; else { for (int i = 2; i <= n; i++) ret = Count(ret); }//else return ret; } string Count(const string &str) { int size = strlen(str.c_str()); //保存结果 stringstream ret; //保存标识字符 char flag = str[0]; //计算标识字符的出现次数 int count = 0 , i = 0; while( i < size ) { //临时循环位 int pos = i; while (str[pos] == flag) { count++; pos++; }//while ret << count << flag; flag = str[pos]; count = 0; //设置下一个循环位 i = pos; }//for return ret.str(); } };
GitHub测试程序源码
相关文章推荐
- 可伸缩性/可扩展性(Scalable/scalability)
- Android UI设计:GridView
- 我的博客迁移到 www.zhenghongzhi.cn
- Hadoop-0.22.0分布式集群配置
- pdf转换为word小工具,挺好
- LeetCode(38) Count and Say
- BZOJ 1483 HNOI2009 梦幻布丁 名单+启示录式的合并
- ZOJ 3891 K-hash 后缀自动机
- Android大图片裁剪终极解决方案(下:拍照截图)
- MYSQL中文输出乱码
- java 面向對象的資料統計
- bitmap描边(光晕)效果
- 关于Scalability的一些思考与疑问
- iOS return和copy的区别
- apache + subversion for linux 安装
- centos服务器操作要点
- keil注册机激活的方法
- Objective-C 【动态类型检测&响应方法】
- Objective-C 【动态类型检测&响应方法】
- [HEOI2012][BZOJ2744] 朋友圈|匈牙利算法|最大独立集|最大团