题目
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
解题思路
1.先求出格雷码的二进制形式,然后再求出它的十进制,这种方法对时间和空间的要求较高。
2.直接通过公式得到相应的格雷码的十进制:G(i) = i ^ (i >> 1),即第i个格雷码的十进制为i异或(i >> 1)。
AC代码(仅方法二)
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> results;
for(int i = 0; i < (1 << n); ++i)
results.push_back(i ^ (i >> 1));
return results;
}
};