首页 > 代码库 > [LeetCode] Count and Say
[LeetCode] Count and Say
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.
string say;string countAndSay(int n) { if(n == 1) return "1"; say = "1"; //return say "n - 1" for(int i = 1;i < n;i++) { string tmp = ""; char cur = say[0]; int count = 1; for(int j = 1;j < say.length();j++) { if(say[j] == cur) { count++; } else { tmp = tmp + char(count + ‘0‘) + cur; cur = say[j]; count = 1; } } tmp = tmp + char(count + ‘0‘) + cur; say = tmp; } return say; }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。