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.
[Solution]
class Solution {
public:
string countAndSay(int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
// n <= 0
if(n <= 0)return "";
// n > 0
int i = 0, count = 0;
char pre;
string res = "1", tmp = "";
// count and say
while(--n){
// init
tmp = "";
pre = res[0];
count = 1;
i = 1;
// count
while(res[i] != '\0'){
if(res[i] != pre){
tmp += (char)('0' + count);
tmp += pre;
count = 0;
}
pre = res[i];
count++;
i++;
}
// be careful the last one
if(count > 0){
tmp += (char)('0' + count);
tmp += pre;
}
// replace
res = tmp;
}
return res;
}
};
说明:版权所有,转载请注明出处。 Coder007的博客