LeetCode 38. Count and Say C++ / Java

The count-and-say sequence is the sequence of integers with the first five terms as following:
「外观数列」是一个整数序列，从数字 1 开始，序列中的每一项都是对前一项的描述。前五项如下：

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.
1 被读作 “one 1” (“一个一”) , 即 11。
11 被读作 “two 1s” (“两个一”）, 即 21。
21 被读作 “one 2”, “one 1” （“一个二” , “一个一”) , 即 1211。

Given an integer n where 1 ≤ n ≤ 30, generate the nth term of the count-and-say sequence. You can do so recursively, in other words from the previous member read off the digits, counting the number of digits in groups of the same digit.
给定一个正整数 n（1 ≤ n ≤ 30），输出外观数列的第 n 项。

Note: Each term of the sequence of integers will be represented as a string.
注意：整数序列中的每一项将表示为一个字符串。

Example 1:

Input: 1
Output: "1"
Explanation: This is the base case.

Example 2:

Input: 4
Output: "1211"
Explanation: For n = 3 the term was "21" in which we have two groups "2" and "1", "2" can be read as "12" which means frequency = 1 and value = 2, the same way "1" is read as "11", so the answer is the concatenation of "12" and "11" which is "1211".

分析：

题目意思大概是这样，前五个数：
1 （第一个数固定是1)
11 (上一项数有 1个1 所以是11 ）
21 （上一项数有 2个1 所以是 21 ）
1211 （上一项数有 1个2 1个1 所以是 12 21 ）
111221 (上一项数有 1个1 1个2 2个1，所以是 11 12 21 )
需要注意的是第4项 按照题目意思不能理解成有3个1，1个2。 而是1个1，1个2，2个1

C++

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

Java

class Solution {
    public String countAndSay(int n) {
        if(n == 0) return "";
        StringBuilder res =  new StringBuilder();
        res.append('1');
        for(int j = 1; j < n; j++){
            StringBuilder cur = new StringBuilder();
            for(int i = 0; i < res.length(); i++){
                int cnt = 1;
                while( (i < res.length() - 1) && (res.charAt(i) == res.charAt(i+1)) ){
                    cnt++;
                    i++;
                }
                cur.append(cnt);
                cur.append(res.charAt (i) );
            }
            res = cur;
        }
        return res.toString();
    }
}

这题和PAT乙级的这一题几乎一模一样。
PAT 1084 外观数列