- 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, find the sequence of gray code. A gray code sequence must begin with 0 and with cover all 2n integers.
Example
Given n = 2, return [0,1,3,2]. Its gray code sequence is:
00 - 0
01 - 1
11 - 3
10 - 2
Challenge
O(2n) time.
Notice
For a given n, a gray code sequence is not uniquely defined.
[0,2,3,1] is also a valid gray code sequence according to the above definition.
解法:
基于(i ^ (i << 1))的异或操作。
代码如下:
class Solution {
public:
/**
* @param n: a number
* @return: Gray code
*/
vector<int> grayCode(int n) {
vector<int> result;
int len = 1 << n;
// result.reserve(len);
for (int i = 0; i < len; ++i) {
result.push_back(i ^ (i >> 1));
}
return result;
}
};