Gray Code
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个格雷码 = n ^ (n>>1),当然都是二进制计算。
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> res;
int size = 1<<n;
for (int i=0; i<size; i++)
res.push_back((i>>1)^i);
return res;
}
};