The count-and-say sequence is the sequence of integers with the first five terms as following:
1. 1 2. 11 3. 21 4. 1211 5. 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 term of the count-and-say sequence.
Note: Each term of the sequence of integers will be represented as a string.
Example 1:
Input: 1 Output: "1"
Example 2:
Input: 4 Output: "1211"
第n次的字符串是读出第n-1次的字符串,要求求出第n次字符串。没发现第n次的字符串和n之间有关系,所以直接用暴力的方法----从1~n都读一遍。
代码:
class Solution
{
public:
string countAndSay(int n)
{
string s = "1";
while(--n)
{
int i = 0;
string tmp;
s += '#';
while(i < s.size()-1)
{
int count = 1;
while(s[i] == s[i+1])
{
++count;
++i;
}
tmp += to_string(count) + s[i];
++i;
}
s = tmp;
}
return s;
}
};