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.
如果你看出了规律就很好理解了。
class Solution {
public:
string countAndSay(int n) {
string pre = "1";
for(int ii = 2; ii <= n; ii ++) {
string current;
for(int jj = 0; jj < pre.length(); jj ++) {
int kk = jj;
while(kk + 1 < pre.length() && pre[kk] == pre[kk + 1]) {
kk ++;
}
current += '0' + (kk - jj + 1);
current += pre[jj];
jj = kk;
}
pre = current;
}
return pre;
}
};