题目描述
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.
解法一:
GrayCode生成算法:(递归版本)
假设G(n)表示n位graycode,那么首先得先求出G(n-1).
再经由如下两步来实现从G(n-1) 到 G(n) 的求解。
1、将G(n-1)的从左到右每一位的左边都加上一个0;
2、将G(n-1)逆序,然后,每一位的左边都加上一个1;
这样就合成的G(n)的结果,即n位graycode。上述两步过程,对照着图看进行理解。
解法二:
公式法。
GrayCode生成算法有数学公式:整数n的GrayCode是:G(n) = n ^ (n/2)
n 跟 n/2 进行异或得到 n的格雷码。
因此要得到,n比特位格雷码,从0 到 2^n -1 依次求格雷码。
实现代码:
(递归版本)
<span style="font-family:SimSun;font-size:18px;">
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> ans;
if(n<=0)
{
ans.push_back(0);
return ans;
}
if(n==1)
{
ans.push_back(0);
ans.push_back(1);
}
else
{
vector<int> mid_ans = grayCode(n-1);
for(int i=0; i< mid_ans.size();i++)
{
int temp = 0 << (n-1);
temp = temp | mid_ans[i];
ans.push_back(temp);
}
for(int i= mid_ans.size()-1; i>=0; i--)
{
int temp = 1 << (n-1);
temp = temp | mid_ans[i];
ans.push_back(temp);
}
}
return ans;
}
};
</span>