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.

格雷码:
在一组数的编码中，若任意两个相邻的代码只有一位二进制数不同，则称这种编码为格雷码（Gray Code），另外由于最大数与最小数之间也仅一位数不同，即“首尾相连”，因此又称循环码或反射码。

由此可以看出新的序列其实是在前面序列基础上插入新的值
其中前半部分的数值不变，后半部分的数值为上个序列中每个元素第n个位变1，逆向插入

    vector<int> grayCode(int n) {
        vector<int> dp;
        dp.push_back(0);
        if(n == 0)
            return dp;
        for(int i = 1; i<= n; i++){
            for(int j = pow(2, i-1)-1; j >= 0; j--){
                dp.push_back(dp[j]|(1<<i-1));  //将第i为变为1
            }
        }
        return dp;
    }