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.
输出格雷码
|
例如：二进制码0101，为4位数，所以其所转为之格雷码也必为4位数，因此可取转成之二进位码第五位为0，即0 b3 b2 b1 b0。
0 xor 0=0，所以g3=0
0 xor 1=1，所以g2=1
1 xor 0=1，所以g1=1
0 xor 1=1，所以g0=1
因此所转换为之格雷码为0111
|
class Solution { //2进制转Gray Code 最高位不变，其余每位是与其高一位异或的结果，即(B(n)/2)^B(n)
public:
vector<int> grayCode(int n) {
vector<int> res;
for(int i=0;i<(1<<n);i++)
res.push_back(i^(i>>1));
return res;
}
};原文：http://blog.csdn.net/u011391629/article/details/52152124