leetcode: Count and Say

http://oj.leetcode.com/problems/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.

思路：

没啥难度，慢慢数呗，用两个string交叉迭代。

class Solution {
public:
    string countAndSay(int n) {
        string results[2];
        int curr = 0, next = 1;
        
        results[0] = "1";
        for (int i = 1; i < n; ++i) {
            int curr_len = results[curr].length();
            
            for (int j = 0; j < curr_len; ) {
                int sum = 1, k = j + 1;
                
                while (k < curr_len) {
                    if (results[curr][j] == results[curr][k]) {
                        ++k;
                        ++sum;
                    }
                    else {
                        break;
                    }
                }

                results[next].append(1, sum + '0');
                results[next].append(1, results[curr][j]);
                
                j = k;
            }
            
            swap(curr, next);
            results[next].clear();
        }
        
        return results[curr];
    }
};