您的位置:首页 > 其它

Leetcode 38 Count and Say

2016-09-06 17:08 453 查看
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 result="1";
for(int i=1;i<n;i++)
{
string temp;
for(int j=0;j<result.length();j++)
{
int cnt=1;
while(j<result.length()-1 && result[j]==result[j+1])
{
cnt++;
j++;
}
temp+=to_string(cnt)+result[j];
}
result=temp;
}
return result;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: