题目相关
【题目解读】
这个题理解起来有些难度,读了好几遍才明白是咋回事。
其实就是输出指定数字n的上一个n-1输出序列对应的count-and-say结果,,其中count-and-say的含义为:“第一个数字是计数,第二个数字为值”,即,‘11’表示1个1,当n=3时,输出‘11’的count-and-say结果:‘2个1’。
【题目】原题链接
The count-and-say sequence is the sequence of integers with the first five terms as following:
- 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 where 1 ≤ n ≤ 30, generate the n t h n^{th} 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"
【难度】Easy
Solution
根据上面的题目解读可以知道,给定的n值,我们需要求得n-1对应的结果,所以需要从n=1开始进行计算,于是采用了以下方法:
string getNext(const string str_ans)
{
if(str_ans == "") return "1";
string str_ret;
int len = str_ans.size();
int count = 1;
for (int i = 0; i < len; ++i)
{
if(i + 1 < len && str_ans[i] == str_ans[i+1])
{
count ++;
continue;
}
str_ret = str_ret + std::to_string(count) + str_ans[i];
count = 1; //下一次计算需要使用,恢复
}
return str_ret;
}
string countAndSay(int n) {
if(n == 0) return "";
string str_ans = "";
for(int i = 0; i < n; i++)
{
str_ans = getNext(str_ans);
}
return str_ans;
}
对应的提交结果为:
运行时间和内存使用量都比较大。