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].
题目大意:
二进制编码每次只能变换一个位置,从零开始,将变换之后的序列按照十进制输出。n代表有多少位。
解题思路:
以两位数为例,实际上第二部分就是对第一部分从后往前多加了一个2的1次方。所以我们就可以将问题视作对vector中已存在的数加上2的n次方。
class Solution {
public:
vector<int> grayCode(int n) {
vector<int > ans;
ans.push_back(0);
int b = 1;
for(int i = 0;i<n;i++){
for(int j = ans.size()-1;j>=0;j--){
ans.push_back(ans[j]+b);
}
b <<= 1;
}
return ans;
}
};