LeetCode 38. Count and Say

https://leetcode.com/problems/count-and-say/description/

The count-and-say sequence is the sequence of integers with the first five terms as following:

1.     1
2.     11
3.     21
4.     1211
5.     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 term of the count-and-say sequence.

Note: Each term of the sequence of integers will be represented as a string.

Example 1:

Input: 1
Output: "1"

Example 2:

Input: 4
Output: "1211"

---

Hide Hint 1  

The following are the terms from n=1 to n=10 of the count-and-say sequence:

 1.     1
 2.     11
 3.     21
 4.     1211
 5.     111221 
 6.     312211
 7.     13112221
 8.     1113213211
 9.     31131211131221
10.     13211311123113112211

Hide Hint 2   

To generate the nth term, just count and say the n-1th term.

---

• 字符串简单题。主要是分析清楚模拟算法。
• to_string - C++ Reference
  • http://www.cplusplus.com/reference/string/to_string/

//
//  main.cpp
//  LeetCode
//
//  Created by Hao on 2017/3/16.
//  Copyright © 2017年 Hao. All rights reserved.
//

#include <iostream>
#include <cstring>
#include <vector>
using namespace std;

class Solution {
public:
    string countAndSay(int n) {
        if (n <= 0) return ""; // corner case
        
        string sResult = "1", sTemp = "";
        int count = 0, j = 0;
        
        for (int i = 1; i < n; i ++) {
            j = 0;
            sTemp = "";
            
            while (j < sResult.size()) {
                count = 1;
                
                while (j + 1 < sResult.size() && sResult.at(j) == sResult.at(j + 1)) {
                    ++ j;
                    ++ count;
                }
                
                sTemp = sTemp + to_string(count) + sResult.at(j);
                
                ++ j;
            }
            
            sResult = sTemp;
        }
        
        return sResult;
    }
};

int main(int argc, char* argv[])
{
    Solution    testSolution;
    string      result;
    
    vector<int> iVec = {0, 1, 2, 3, 4, 5};
    
    /*
     
     1
     11
     21
     1211
     111221
     */
    for (auto i : iVec) {
        cout << testSolution.countAndSay(i) << endl;
    }

    return 0;
}