[Leetcode]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.

class Solution {
public:
    /*algorithm 
        hash based brute force
        time(O(2^n*n) space O(2^n)
    */
    vector<int> grayCode(int n) {
            unordered_set<int>set;
            vector<int>path;
            int code = 0;
            int count = 1<<n;
            while(path.size() < count){
                path.push_back(code);
                set.insert(code);
                for(int i = 0;i < n;i++){//n bit
                    int newcode = code ^ (1<<i);//flip bit on position i
                    if(!set.count(newcode)){
                        code = newcode;
                        break;
                    }
                }   
            }
            return path;
    }
};

class Solution {
public:
    /*algorithm 
        see http://rosettacode.org/wiki/Gray_code
        g = g ^ (g >>1)
        time O(2^n) space O(1)
    */
    vector<int> grayCode(int n) {
            vector<int>path;
            for(int i = 0;i < (1<<n);i++)
                path.push_back(i^(i>>1));
            return path;
    }
};