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.

» Solve this problem

class Solution {
private:
    void search(vector<int> &ans, bool f[], int n, int id[], int value) {
        
    }
    
public:
    vector<int> grayCode(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> ans;
        int id[n], value = 0;
        int max = pow(2, n);
        bool f[max];        
        memset(f, true, sizeof(bool) * max);
        memset(id, 0, sizeof(int) * n);
        
        f[value] = false;
        ans.push_back(value);
        for (int i = 1; i < max; i++) {
            for (int j = 0; j < n; j++) {
                if (id[j] == 0 && f[value + (int) pow(2, j)]) {
                    value += pow(2, j);
                    id[j] = 1;
                    f[value] = false;
                    ans.push_back(value);
                    break;
                }
                else if (id[j] == 1 && f[value - (int) pow(2, j)]) {
                    value -= pow(2, j);
                    id[j] = 0;
                    f[value] = false;
                    ans.push_back(value);
                    break;
                }
            }
        }
        
        return ans;
    }
};

public class Solution {
    private Set<Integer> sets = new HashSet<Integer>();
    
    public int transform(int value, int n) {
        int bit = 1, temp = 0;
        for (int i = 0; i < n; i++) {
            temp = (bit & value) == 0 ? value + bit : value - bit;
            if (!sets.contains(temp)) {
                return temp;
            }
            bit = bit << 1;
        }
        return 0;
    }
    
    public ArrayList<Integer> grayCode(int n) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        sets.clear();
        ArrayList<Integer> answer = new ArrayList<Integer>();
        int count = 1 << n, value = 0;
        answer.add(value);
        sets.add(value);
        for (int i = 1; i < count; i++) {
            value = transform(value, n);
            answer.add(value);
            sets.add(value);
        }
        return answer;
    }
}