89. 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.
解题思路:
科普一下:格雷码 (因为我也不知到这是啥)
详情见这位大佬的博文
代码:
class Solution { public: vector<int> grayCode(int n) { vector<int> ret; n = pow(2, n); for(int i = 0; i < n;i++){ ret.push_back((i>>1)^i); } return ret; } };