Gray Code

The gray code is a binary numeral system where two successive values differ in only one bit.

Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0.

For example, given n = 2, return [0,1,3,2]. Its gray code sequence is:

00 - 0
01 - 1
11 - 3
10 - 2

Note:
For a given n, a gray code sequence is not uniquely defined.

For example, [0,2,3,1] is also a valid gray code sequence according to the above definition.

For now, the judge is able to judge based on one instance of gray code sequence. Sorry about that.

解法1：翻倍折叠法，对每一个位置的1（只有一个bit位为1），都可以把之前已经得到的一个数组翻倍（从后向前，相当于镜面折叠的效果），每个新增的元素对应一个原数组元素再最高位或上当前这个1. 这样可以知道每相邻两个元素都只有一个bit位的差别，这算是生成gray code的常用方式。


解法2： 参见matrix67的博文 http://www.matrix67.com/blog/archives/266 ， 这是一个位运算的系列，很有分量哦。

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> ret;
        if (n < 0) return ret;
        
        // 1
        /*
        ret.push_back(0);
        for (int i = 0; i < n; i++) {
            int cm = (1 << i);
            int cnt = ret.size();
            for (int j = cnt - 1; j >= 0; j--) {
                ret.push_back(ret[j] | cm);
            }
        }
        */
        
        // 2
        int cnt = (1 << n);
        for (int i = 0; i < cnt; i++) {
            ret.push_back(i ^ (i >> 1));
        }
        return ret;
    }
};