089 Grey Code [Leetcode]

题目内容：

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.

先看一下grey code在维基百科中的介绍吧：
英文版：
https://en.wikipedia.org/wiki/Gray_code
中文版：
https://zh.wikipedia.org/w/index.php?title=%E6%A0%BC%E9%9B%B7%E7%A0%81&variant=zh-hk&oldid=31071160

直接排列的规则是：

1. 以二进制0为第0项
2. 改变最右边的位元
3. 改变右起第一个1的位元的左边位元
4. 回到步骤2

举个三位格雷码的例子：
000
001
011
010
110
111

根据这个可以逐个生成位元，时间复杂度为O(n)。

寻找二进制码和格雷码之间的数学规律的话，还有：
G：格雷码 B：二进制码

G(N) = (B(n)/2) XOR B(n)

根据此规律可以很容易实现如下：

class Solution {
public:
    vector<int> grayCode(int n) {
        if(n < 0) {
            vector<int> empty;
            return empty;
        }

        long long size = 1;
        size = size << n;
        vector<int> result(size);

        for(int i = 0; i < size; ++i) {
            result[i] = ((i >> 1) ^ i);
        }

        return result;
    }
};