LeetCode38 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.（Easy）

分析:

按照题目要求以此生成新串即可，注意第一个是串是1，即下标从1开始。

同时，复习使用to_string.

代码：

 class Solution {
 public:
     string countAndSay(int n) {
         string s = "";
         for (int i = ; i < n; ++i) {
             int count = ;
             string temp;
             for (int j = ; j < s.size(); ++j) {
                 if (j == s.size() -  || s[j] != s[j + ]) {
                     temp += to_string(count);
                     temp += s[j];
                     count = ;
                 }
                 else {
                     count ++;
                 }
             }
             s = temp;
         }
         return s;
     }
 };