Leetcode 38. 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.

s思路：
1. 规律已经有了，直接产生。

class Solution {public:    string countAndSay(int n) {        //        if(n<1) return "";        string res="1";        int count=1;        while(--n){            string cur="";            for(int i=0;i<res.size();i++){                if(i+1<res.size()&&res[i]==res[i+1])                    count++;                else{                    cur+=(to_string(count)+res[i]);                    count=1;                    }            }            res=cur;        }        return res;    }};