【LeetCode】 038. Count and Say
来源:互联网 发布:佛山万科金域名都酒店 编辑:程序博客网 时间:2024/05/15 05:56
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 class Solution { public String countAndSay(int n) { String res = "1"; for (int i = 1; i < n; i++) { StringBuilder temp = new StringBuilder(); char c = '0'; int count = 0; for (int j = 0; j < res.length(); j++) { c = res.charAt(j); if (count != 0 && res.charAt(j - 1) != c) { temp.append(count).append(res.charAt(j - 1)); count = 0; } count++; } temp.append(count).append(c); res = temp.toString(); } return res; }}
0 0
- 【LeetCode】038.Count and Say
- 【LeetCode】 038. 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
- [LeetCode] Count and Say
- Count and Say 【leetcode】
- [LeetCode] Count and Say
- Leetcode Count and Say
- oracle:linux或者ubuntu下oracle 11G的完全卸载
- 在centos6.5下编译安装LNMP环境(更新)
- setClickable(false)与setEnabled(false)一点小发现
- ALSA(二), makefile, Autotools, premake
- HDU 5441 Travel (离线处理+并查集)
- 【LeetCode】 038. Count and Say
- 登录注册 所用到的校验
- hadoop使用
- Win7开启休眠
- 【CDOJ 1344】卿学姐种美丽的花
- bootstrap如何给.list-group加上序号
- Poj 2955 Brackets【区间dp】
- Java基本数据类型
- POJ 2288 Islands and Bridges (状压DP)