[leetcode] 89. 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.

这道题是生成n位格雷码，题目难度为Medium。

格雷码相信大家都熟悉，就不介绍了。根据格雷码的特点，我们发现N+1位格雷码可以在N位格雷码的基础上生成，前半部分直接在N位格雷码之前加‘0’（不用改变），后半部分把N位格雷码倒序排列之后在前面加‘1’，这样就得到了N+1位的格雷码。具体代码：

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

另外，二进制数字到格雷码有转换公式grayCode = binNum ^ (binNum>>1)，根据公式即可依次生成所有的格雷码。公式推导就不说了，不明白的同学可以问下度娘。具体代码：

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> ret;
        int cnt = pow(2, n);
        for(int i=0; i<cnt; ++i)
            ret.push_back(i ^ (i>>1));
        return ret;
    }
};