首页 > 代码库 > 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.
递推即可，
每count and say一次，统计字符串中连续字符出现的次数，然后将其转化成字符串即可
class Solution {public: string countAndSay(int n) { string init = "1"; for(int i = 1 ; i < n ; ++ i){ int cnt =1; char pre = init[0]; string str = ""; for(int j = 1 ; j < init.length(); ++ j){ if(init[j]!=pre){ str+=to_string(cnt)+pre; cnt = 1; pre = init[j]; }else{ cnt++; } } str+=to_string(cnt)+pre; init = str; } return init; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。