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.
可以采用的方式是计数,前进。
该题可以采用计数的方式,依次遍历,比如1211,1个1,就将整数1转换为字符,然后将11添加到结果字符串中,1个2,就将1转换为字符,然后将12添加到结果字符串中,2个1,将2转换为字符,然后将21添加到结果字符串中。
class Solution {
public:
string countAndSay(int n) {
string res="1";
for(int i=1;i<n;i++)
{
string temp;
int count=1;
char ch=res[0];
for(int j=1;j<res.size();j++)
{
if(res[j]==ch)
count++;
else{
temp.push_back(char(count+'0'));
temp.push_back(ch);
ch=res[j];
count=1;
}
}
temp.push_back(char(count+'0'));
temp.push_back(ch);
res=temp;
}
return res;
}
};