题目来源:leetcode
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开始每次增加的为红色数字。那么红色数字是怎么构成的呢?就是在上一个n的所有情况前边加1,后边由上个n的的倒叙组成
了解了变化的部分构造出变化的部分 几首字母2^(n-1)次方加之前对应位置的数字
import java.util.*;
public class GrayCode {
public List<Integer> grayCode(int n) {
List<Integer> res=new ArrayList<>();
if(n<0)
return res;
res.add(0);
if(n==0)
return res;
res.add(1);
if(n==1)
return res;
for(int i=2;i<=n;i++){
int first=2<<(i-2);//定义增加首位1时候增加的数2^(i-1)
for(int j=res.size()-1;j>=0;j--)
res.add(first+res.get(j));
}
return res;
}
}