[Leetcode学习-c++&java]Count and Say

问题：

难度：medium

说明：

首先第一个数字是 1。

然后开始进行游程编码：11，意思是 1 个 1

下一步继续游程编码：21，意思是 2 个 1

继续： 1211 意思是 1 个 2 ，1 个 1

求第 N 步的结果是多少

题目连接：https://leetcode.com/problems/count-and-say/

输入范围：

• 1 <= n <= 30

输入案例：

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

Example 2:
Input: n = 4
Output: "1211"
Explanation:
countAndSay(1) = "1"
countAndSay(2) = say "1" = one 1 = "11"
countAndSay(3) = say "11" = two 1's = "21"
countAndSay(4) = say "21" = one 2 + one 1 = "12" + "11" = "1211"

---

我的代码：

只是游程编码罢了，然后就是多次游程而已：

Java：

class Solution {
    private static int[][] stack = new int[2][5000]; 
    public String countAndSay(int n) {
        int pre = 1, cur = 0, idx1 = 0, idx2 = 0;
        stack[cur][idx1 ++] = 1;
        while(n -- > 1) {
            for(int i = 0; i < idx1;) {
                int tmp = stack[cur][i], cnt = 0;
                while(i < idx1 && stack[cur][i] == tmp) {
                    i ++; cnt ++;
                }
                stack[pre][idx2 ++] = cnt;
                stack[pre][idx2 ++] = tmp;
            }
            pre ^= 1;
            cur ^= 1;
            idx1 = idx2;
            idx2 = 0;
        }
        StringBuilder builder = new StringBuilder();
        for(int i = 0; i < idx1; i ++) builder.append(stack[cur][i]);
        return builder.toString();
    }
}

C++：

int twoQueue[2][5000];

class Solution {
public:
    string countAndSay(int n) {
        int cur = 0, pre = 1, idx1 = 0, idx2 = 0;
        twoQueue[cur][idx1 ++] = 1;
        while(n -- > 1) {
            for(int i = 0; i < idx1;) {
                int tmp = twoQueue[cur][i], cnt = 0;
                while(i < idx1 && twoQueue[cur][i] == tmp) {
                    i ++; cnt ++;
                }
                twoQueue[pre][idx2 ++] = cnt;
                twoQueue[pre][idx2 ++] = tmp;
            }
            pre ^= 1;
            cur ^= 1;
            idx1 = idx2;
            idx2 = 0;
        }
        
        string res = "";
        for(int i = 0; i < idx1; i ++) {
            res += to_string(twoQueue[cur][i]);
        }
        
        return res; 
    }
};