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