LeetCode——Count and Say
2015-02-15 17:02
501 查看
The count-and-say sequence is the sequence of integers beginning as follows:
Given an integer n, generate the nth sequence.
Note: The sequence of integers will be represented as a string。
原题链接:https://oj.leetcode.com/problems/count-and-say/
能够看出,后一个数字是前个数字的读法,21读作1个2,先写下12,1个1,再写下11,连起来1211.
1, 11, 21, 1211, 111221, ...
1is read off as
"one 1"or
11.
11is read off as
"two 1s"or
21.
21is 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。
原题链接:https://oj.leetcode.com/problems/count-and-say/
能够看出,后一个数字是前个数字的读法,21读作1个2,先写下12,1个1,再写下11,连起来1211.
public static String countAndSay(int n) { if(n <= 0) return null; String str = "1"; int count = 1; for(int i=0;i<n-1;i++){ StringBuilder builder = new StringBuilder(); for(int j=0;j<str.length();j++){ if(j<str.length()-1 && str.charAt(j)==str.charAt(j+1)) count++; else{ builder.append(count + "" + str.charAt(j)); count = 1; } } str = builder.toString(); } return str; }
相关文章推荐
- Leetcode: Count and Say
- [LeetCode] Count and Say
- LeetCode 38 Count and Say
- LeetCode - 38 - Count and Say
- Leetcode--Count and Say
- [leetcode]Count and Say
- leetcode第38题-Count and Say
- 37 leetcode - Count and Say
- leetcode - Count and Say
- Leetcode 38 Count and Say
- leetcode-38-count and say
- LeetCode -- Count and Say
- leetcode_Count and Say
- leetcode记录——Count and Say
- leetcode ——Count and Say
- Java [leetcode 38]Count and Say
- LeetCode刷题笔录Count and Say
- leetcode--Count and Say
- [LeetCode] Count and Say, Solution
- Leetcode -- Count and Say