#411 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, find the sequence of gray code. A gray code sequence must begin with 0 and with cover all 2nintegers.

 Notice

For a given n, a gray code sequence is not uniquely defined.

[0,2,3,1] is also a valid gray code sequence according to the above definition.

Have you met this question in a real interview? 

Yes

Example

Given n = 2, return [0,1,3,2]. Its gray code sequence is:

00 - 0
01 - 1
11 - 3
10 - 2

Challenge 

O(2n) time.

题目思路：

这题感觉不是太好，因为gray code在wiki上是有公式可以直接计算的。这里就偷懒了，列了个公式直接求了。

Mycode（AC = 19ms）：

class Solution {
public:
    /**
     * @param n a number
     * @return Gray code
     */
    vector<int> grayCode(int n) {
        // Write your code here
        vector<int> gray(1 << n, 0);
        
        int num = 0;
        for (int i = 0; i < gray.size(); i++) {
            // use equation in wikipedia for gray code
            gray[i] = num ^ (num >> 1);
            num++;
        }
        
        return gray;
    }
};