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=1时输出字符串1;n=2时,数上次字符串中的数值个数,因为上次字符串有1个1,所以输出11;n=3时,由于上次字符是11,有2个1,所以输出21;n=4时,由于上次字符串是21,有1个2和1个1,所以输出1211。依次类推,写个countAndSay(n)函数返回字符串。
Input:
1
Output:
"11"
Expected:
"1"
Input:
2
Output:
"2"
Expected:
"11"
public class Solution {
public String countAndSay(int n) {
String oldString = "1";
while (--n > 0) {
StringBuilder sb = new StringBuilder();
char [] oldChars = oldString.toCharArray();
for (int i = 0; i < oldChars.length; i++) {
int count = 1;
while ((i+1) < oldChars.length && oldChars[i] == oldChars[i+1]) {
count++;
i++;
}
sb.append(String.valueOf(count) + String.valueOf(oldChars[i]));
}
oldString = sb.toString();
}
return oldString;
}
}