标签：
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 – 2Note:
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
格雷编码，首位不变，后面的数据，依次与前一位做异或。
自然二进制码转换为格雷码：g0 = b0, gi = bi ⊕ bi?1
vector<int> grayCode(int n) { vector<int> result; const size_t size = 1 << n; // 2^n result.reserve(size); for (size_t i = 0; i < size; ++i) result.push_back(i ^ (i >> 1)); return result; }
标签：
原文地址：http://www.cnblogs.com/panweishadow/p/4783965.html
