LeetCode/Solution38.h at master · ahuang007/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
//
// Author: huanglijun
// Date  : 2019/6/1
// Desc  : Solution38
//

/*
 * 38. Count and Say
 * 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 where 1 ≤ n ≤ 30, 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"
 */

#include <string>
#include <sstream>

string countAndSay(int n) {
    if(n <= 0) return "";
    if(n == 1) return "1";

    string str = "1";
    for(int i = 2; i <= n; i++){
        int slen = (int)str.size();
        stringstream newStr;
        int count = 0;
        char c = str[0];
        int num = 0;
        while(count < slen){
            if(str[count] == c){
                num++;
            } else {
                newStr<<num;
                newStr<<c;
                c = str[count];
                num = 1;
            }
            count++;
        }
        if(count == slen){
            newStr<<num;
            newStr<<c;
        }
        str = newStr.str();
    }
    return str;
}

#ifndef TESTCODE_SOLUTION38_H
#define TESTCODE_SOLUTION38_H

#endif //TESTCODE_SOLUTION38_H