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 有一个1 所以是11
11 有两个1 所以是21
21 有一个2和一个1 所以是12 11
注意1211 并不是数这里面有多少个2多少个1,而是数字改变了算新的数字,第二位是2第三位是1,那么第三位上的1算是新数字,所以是 11 12 21
Source
public String countAndSay(int n) {
if(n == 1) return "1";
String a = "1";
n = n - 1; //第一个值“1”已经存在
while(n > 0){
StringBuffer st = new StringBuffer();
int c = 0,i;
char k = a.charAt(0);
for(i = 0; i < a.length(); i++){
if(a.charAt(i) == k) c++;
else{
st.append(c).append(k); //***加入之前相同的
c = 1;
k = a.charAt(i);
}
}
st.append(c).append(k); //加入之前相同与不同的
a = st.toString(); //
n--;
}
return a;
}