问题描述:
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,依次类推。
过程详见代码:
class Solution {
public:
string countAndSay(int n) {
if(n <= 0) return "";
string say = "1";
for(int i = 1;i < n;i++)
{
int count = 0;
char last = say[0];
stringstream ss;
for(int j = 0;j < say.length();j++)
{
if(say[j] == last) count++;
else
{
ss << count << last;
count = 1;
last = say[j];
}
}
ss << count << last;
say = ss.str();
}
return say;
}
};