【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.

---

思路：
普通数字i到格雷码g的转换公式：g = i xor (i >> 1)。

我没研究过格雷码，我不知道原理，我也是看的https://blog.csdn.net/makuiyu/article/details/44926463的。

---

代码实现：

class Solution {
public:
    vector<int> grayCode(int n) {
        int total = 1 << n;
        vector<int> ans;
        for (int i = 0; i < total; ++i){
            ans.push_back(i^(i>>1));
        }
        
        return ans;
    }
};

discuss:

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> res(1, 0);
        for (int i = 0; i < n; ++i){
            int size = res.size();
            for (int j = size - 1; j >= 0; --j) // 倒着处理每一个格雷码
                res.push_back(res[j] | 1 << i); // 先算1<<i，再算|
        }
        
        return res;
    }
};

---

参考：https://blog.csdn.net/makuiyu/article/details/44926463