首页 > 代码库 > 【LeetCode】Count and Say
【LeetCode】Count and Say
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.
思路：对于下一个字符串= 对于当前字符串：∑(字符个数+字符)
例如1211，下一个字符串就是count(1)+‘1‘+count(2)+‘2‘+count(1)+‘1‘=111221
class Solution {public: string countAndSay(int n) { if(n == 0) return ""; else { string last = "1"; string next = ""; n--; while(n--) { next = ""; int i = 0; char cur = last[i]; int count = 0; while(i < last.size()) { count = 0; cur = last[i]; while(i < last.size() && last[i] == cur) { count ++; i ++; } char temp[32]; sprintf(temp, "%d", count); string countStr = temp; next += countStr; next += cur; } last = next; } return last; } }};
【LeetCode】Count and Say
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。