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.
二进制格雷码
格雷码利用递归的如下规则来构造:
n+1位格雷码的集合 = n位格雷码集合(顺序)加前缀0 + n位格雷码集合(逆序)加前缀1
-----------------------------------------------------------------------------------------
牛客网上大神的图借用一下。。。。。
解法一
思路:n+1位格雷码的集合 = n位格雷码集合(顺序)加前缀0 + n位格雷码集合(逆序)加前缀1 。利用这个规律。
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> grayCode(int n) {
ArrayList<Integer> res = new ArrayList<>();
if(n < 0)
return res;
//构建起始集合,n = 0时
res.add(0);
for(int i = 0; i < n; i++){
//进行左移运算,以便与获得的逆序进行或运算,使得逆序最高位变为1
int high_bit = 1 << i;
//倒着遍历,获取逆序
for(int j = res.size() - 1; j >=0; j--){
//逆序加上前缀1,即最高位
res.add(res.get(j) | high_bit);
}
}
return res;
}
}
解法二
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> grayCode(int n) {
ArrayList<Integer> res = new ArrayList<Integer>();
if(n < 0)
return res;
//右移运算,得到结果集范围的二进制形式
int range = 1 << n;
//结果集元素大小的范围是[0,range)二进制,下面进行元素转换以调整元素在结果集中的顺序
for(int i = 0; i < range; ++i){
//i进行右移一位运算然后再与原来的i进行异或运算
res.add(i>>1^i);
}
return res;
}
}