leetcode-38. Count and Say
题目:
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) {
if(n<=0) {
return "";
}
String nowStr="1";
for(int current=1; current<n; current++) {
nowStr = getSay(nowStr);
}
return nowStr;
}
String getSay(String pre) {
int count =0;
StringBuilder reStr = new StringBuilder("");
for(int i = 0; i<pre.length(); i++){
count ++;
if ((i+1 < pre.length()) && (pre.charAt(i) != pre.charAt(i + 1))) {
reStr = reStr.append(count).append(pre.charAt(i));
count = 0;
}
else if ((i+1 == pre.length())) {
reStr = reStr.append(count).append(pre.charAt(i));
}
}
return reStr.toString();
}
}