题目:格雷码
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.
Example 1:
Input: 2 Output: [0,1,3,2] Explanation: 00 - 0 01 - 1 11 - 3 10 - 2 For a given n, a gray code sequence may not be uniquely defined. For example, [0,2,3,1] is also a valid gray code sequence. 00 - 0 10 - 2 11 - 3 01 - 1
Example 2:
Input: 0
Output: [0]Explanation: We define the gray code sequence to begin with 0.
A gray code sequence of n has size = 2n, which for n = 0 the size is 20 = 1.
Therefore, for n = 0 the gray code sequence is [0].
格雷码就是上一个二进制数与当前二进数只有一位不同
res[0] 0
i = 0, j = 0, t = 1, res[0]^t 0 ^ 1 --> 1 res[0,1]
res[0,1]
i = 1, j = 1, t = 10, res[1]^t 1 ^ 10 --> 11 res[0,1,11]
i = 1, j = 0, t = 10, res[0]^t 0 ^ 10 --> 10 res[0,1,11,10]
res[0,1,11,10]
i = 2, j = 3, t = 100, res[3] ^ t 10 ^ 100 --> 110 res[0,1,11,10,110]
i = 2, j = 2, t = 100, res[2] ^ t 11 ^ 100 --> 111 res[0,1,11,10,110,111]
.....
代码如下:
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> res{0};
int t = 1;
for(int i = 0; i < n; i++)
{
for(int j = res.size() - 1; j >= 0; j--)
{
res.push_back(res[j]^t);
}
t <<= 1;
}
return res;
}
};