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:
vector<int> grayCode(int n) {
// Note: The Solution object is instantiated only once and is reused by each test case.
vector<int> result;
//flip lowest bit
result.push_back(0);
if(n==0) return result;
result.push_back(1);
//flip higher bits
int plus=1;
//regular pattern of grey code
//G(n)=[G(n-1), G(n-1)+2^n-1 to every element]
for(int i=2; i<=n;i++)
{
plus*=2;
for(int j=result.size()-1;j>=0;j--)
{
result.push_back(plus+result[j]);
}
}
return result;
}
};