Gray Code

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.

解题技巧：

该题是格雷编码，采用递归的方式构造：

1. 1位格雷码有两个码字

2. (n+1)位格雷码中的前2n个码字等于n位格雷码的码字，按顺序书写，加前缀0

3. (n+1)位格雷码中的后2n个码字等于n位格雷码的码字，按逆序书写，加前缀1

4. n+1位格雷码的集合 = n位格雷码集合(顺序)加前缀0 + n位格雷码集合(逆序)加前缀1

代码：

#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
vector<int> grayCode(int n)
{
    vector<int> result;
    result.push_back(0);
    for(int i = 0; i < n; i ++)
    {
        int highest = 1<<i;
        int len = result.size();
        for(int j = len - 1; j >= 0; j --)
        {
            result.push_back(highest+result[j]);
        }
    }
    return result;
}
int main()
{
    int n;
    vector<int> res;
    cin >> n;
    res = grayCode(n);
    for(int i = 0; i < res.size(); i ++)
    {
        cout<<res[i]<<' ';
    }
    cout<<endl;
}