CODE 95: Count and Say
来源:互联网 发布:淘宝杭州网商园 编辑:程序博客网 时间:2024/05/18 21:11
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.
public String countAndSay(int n) {// IMPORTANT: Please reset any member data you declared, as// the same Solution instance will be reused for each test case.if (n <= 0) {return "";}String string = null;for (int i = 1; i <= n; i++) {if (1 == i) {string = "1";} else {char[] cs = string.toCharArray();char tmp = cs[0];int tmpnum = 1;StringBuilder sb = new StringBuilder();for (int j = 1; j < cs.length; j++) {if (cs[j] == tmp) {tmpnum++;} else {sb.append(tmpnum);sb.append(tmp);tmp = cs[j];tmpnum = 1;}}sb.append(tmpnum);sb.append(tmp);string = null;string = sb.toString();}}return string;}
- CODE 95: Count and Say
- [leet code] Count and Say
- leetcode 日经贴,Cpp code -Count and Say
- 【LEET-CODE】38. Count and Say
- Leet Code OJ 38. Count and Say [Difficulty: Easy]
- 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
- Debian安装flash插件心得
- ural 1837 Isenbaev's Number
- C#获取考勤机中的数据
- 我的.gdbinit
- RTP/RTCP/RTSP/SIP/SDP
- CODE 95: Count and Say
- 常用JS验证函数总结
- Hadoop编译方法
- uva 542 - France '98(概率)
- 数据结构的扩张(动态有序统计和区间树)笔记
- Lotus 迁移到Exchange 2010 POC 之在Exchange 2007安装Transport Suite!
- hdu-4753-Fishhead’s Little Game-记忆化搜索
- A Dream
- 13 成都 F