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.
因为gray码是关于2^n-1镜面对称的,n-1位的gray码将其高位加一个1,镜面对称后就变成了n位gray码。
第一种方法:递归
class Solution {
public:
vector<int> grayCode(int n)
{
vector<int>ret;
helper(ret,n);
return ret;
}
void helper(vector<int>&temp,int n)
{
if(n==0)
{
temp.push_back(0);
return;
}
else
helper(temp,n-1);
for(int i=pow(2,n)/2-1;i>=0;i--)
{
int x=temp[i]+pow(2,n-1);
temp.push_back(x);
}
return;
}
};
第二种方法:
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> result;
result.push_back(0);
for(int i=0;i<n;i++){
// mirror the result with shift ith digit to 1
for(int j=result.size()-1;j>=0;j--){
int cur=result[j]+(1<<i);
result.push_back(cur);
}
}
return result;
}
};