本文主要是介绍Easy 11 Count and Say（38），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
Description
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.
Solution
按照规则暴力实现。
class Solution {
public:string countAndSay(int n) {if(n==0) return "";string res="1";while(--n){string ress="";for(int i=0;i<res.size();i++){int count=1;while(i+1<res.size()&&res[i]==res[i+1]){count++;i++;}ress+=to_string(count)+res[i];}res=ress;}return res;}
};这篇关于Easy 11 Count and Say（38）的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
