题目描述
The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 111221, ...
1is read off as"one 1"or11.
11is read off as"two 1s"or21.
21is read off as"one 2, thenone 1"or1211.
Given an integer n, generate the n th 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。依次类推,写个countAndSay(n)函数返回字符串。
典型的递归问题。
实现代码: class Solution {
public:
string countAndSay(int n) {
if(n == 1) return "1";
//递归调用,然后对字符串处理
string str = countAndSay(n-1) + "*";//为了str末尾的标记,方便循环读数
int count = 1; //用于计算每个字符出现的次数;
string s = "";
for(int i = 0; i < str.length() - 1;i++) //因为增加了一个“*”,所以只能遍历到"*"之前的字符;
{
if(str[i] == str[i+1])
{
count++;//计数增加
}
else
{
s = s + to_string(count) + str[i];//个数在前,字符在后;
count = 1;//初始化,为后面的字符做准备;
}
}
return s;
}
};