二进制数只差别一个位 Gray 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.

思路：题目说，虽然这样的规则可能变化顺序不只有一种，但是还是希望我写成它的那种。通过观察，我认为它的位变化顺序应该是0110，0123210这种的。

代码：

class Solution {
public:
    vector<int> grayCode(int n) {
         vector<int> v;
         v.push_back(0);
         if(n == 0)
            return v;
        
         int flag = 1;
         int num = 1<<n;
         int i = 0;
         int tmp = 0;
         for(;num>1;num--)
         {
             v.push_back(tmp^(1<<i));
             tmp ^= 1<<i;
             
             if(flag == 1)
            {
                if(i == n-1)
                {
                    i--;
                    flag = -1;
                }
                else
                    i++;
            }
            else
            {
                if(i == 0)
                {
                    i++;
                    flag = 1;
                }
                else
                    i--;
            }
         }
         return v;
    }
};

一个奇特的方法：为什么当i连续增长时，(i>>1)^i总会bit差1的变化呢？

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> v;
        int num = 1<<n;//num是n位gray码所能表示的整数个数
        for(int i=0;i<num;i++)
            v.push_back((i>>1)^i); //将整数i转化为格雷码的数学公式为n^(n/2)
        return v;
    }
};