题目:
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.
class Solution {
public:
string countAndSay(int n) {
string res = "1";
for (int i = 1; i < n; i++) {
res = next(res);
}
return res;
}
private:
string next(string s) {
string res;
int i = 0, cnt;
while (i < s.size()) {
cnt = 1;
while (i+1 < s.size() && s[i + 1] == s[i]) {
i++;
cnt++;
}
res.push_back(cnt + '0');
res.push_back(s[i]);
i++;
}
return res;
}
};
本文介绍了一种特殊的整数序列——计数与描述序列,并提供了一个C++实现方案,用于生成该序列的第n项。序列从1开始,后续每一项都是对其前一项的描述。
493

被折叠的 条评论
为什么被折叠?



