------QUESTION-----
The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer
For example, given [0,1,3,2]
. Its gray code sequence is:
00 - 0 01 - 1 11 - 3 10 - 2
Note:
For a given
For example, [0,2,3,1]
For now, the judge is able to judge based on one instance of gray code sequence. Sorry about that.
------SOLUTION-----
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> result;
int size = 1 << n;
for (int i =0; i< size; i++)
{
result.push_back(getGrayCode(i));
}
return result;
}
int getGrayCode(int binary)
{
return ((binary >> 1)^binary);
}
};