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 code)是由贝尔实验室的Frank Gray在1940年提出,用于在PCM(脉冲编码调变)方法传送讯号时防止出错,并于1953年三月十七日取得美国专利。格雷码是一个数列集合,相邻两数间只有一个位元改变,为无权数码,且格雷码的顺序不是唯一的。
如题则是从二进制数转换成格雷码。
二进制码→格雷码(编码):
此方法从对应的n位二进制码字中直接得到n为格雷码码字,步骤如下:
1. 对n位二进制的码字,从右到左,以0到n-1编号
2. 如果二进制码字的第i位和i+1位相同,则对应的格雷码的第i位为0,否则为1(当i+1=n时,二进制码字的第n位被认为是0,即第n-1位不变)
公式表示:(G:格雷码,B:二进制码)
代码如下:
class Solution
{
public:
vector<int> grayCode(int n)
{
vector<int> ans;
int size = 1 << n;
for(int i = 0; i < size; ++i)
ans.push_back((i >> 1)^i);
return ans;
}
};