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.
这题的难点在于读懂题意...1读作 "one 1", 所以下一个数就是one和1,也就是11.
11读作" two 1s",所以下一个数就是two和1,也就是21
21读作"one 2, one 1",所以下一个数就是1211
同理后面的数是111221, 312211......
知道了题意就不难了。就是个字符串操作,每次比较当前字符和它前面的字符是不是一样的,如果是,count++。如果不是,则stringbuilder.append(count).append(当前字符)。
public class Solution {
public String countAndSay(int n) {
String s = "1";
for(int i = 1; i < n; i++){
StringBuilder builder = new StringBuilder();
int count = 1;
for(int j = 1; j < s.length(); j++){
if(s.charAt(j) == s.charAt(j - 1)){
count++;
}
else{
builder.append(count).append(s.charAt(j - 1));
count = 1;
}
}
builder.append(count).append(s.charAt(s.length() - 1));
s = builder.toString();
}
return s;
}
}