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.
n=3时,GrayCode是:
000 001 011 010 110 111 101 100
vector<int> grayCode(int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> res;
res.push_back(0);
int highbit = 0;
while(n--)
{
highbit = res.size();
for(int i= res.size()-1; i >= 0; i--)
res.push_back(highbit|res[i]);
}
return res;
}
数学解:
从第0个开始,第i个gray code为:(i>>1)^i
vector<int> grayCode(int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> res;
int num = 1<<n;
int i = 0;
while(i<num)
res.push_back((i>>1)^(i++));
return res;
}