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.
二进制转格雷码的方法是将二进制前补0,然后前后两位异或。gi = bi ^ bi+1 比如 二进制 0101, 则前面添0后 00101,然后从右向左两两位异或得0111 (相异为1,相同为0),得到格雷码 0111, 其实就是对二进制x做 (x>>1)^x 操作。
这道题要对n位数内的所有二进制转换为格雷码,n位数内的所有二进制可用 i = 0; i < (1 << n); i++ 实现,当n = 2的时候,1<<n为100,此时i是和二进制100比,注意不是和十进制100比,所以i 可取 00,01,10,11 即0,1,2,3
还有一种做法是找规律,以3位格雷码为例。
0 0 0
0 0 1
0 1 1
0 1 0
1 1 0
1 1 1
1 0 1
1 0 0
可以看到第n位的格雷码由两部分构成,一部分是n-1位格雷码,再加上 1<<(n-1)和n-1位格雷码的逆序的和。这次没写,下次写的时候注意下。
Source
public class Solution {
public List<Integer> grayCode(int n) {
List<Integer> st = new ArrayList<Integer>();
if(n == 0){
st.add(0); //*** n为0的时候 码为0
return st;
}
for(int i = 0; i < (1 << n); i++ ){ //位操作中,i的end为 1<<n 二进制中以n的数值为长度可以表征的数
st.add(i ^ (i >> 1));
}
return st;
}
}
Test
public static void main(String[] args){
int n = 2;
System.out.println(new Solution().grayCode(n));
}