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.
Solution 1
More details:http://www.cnblogs.com/yuzhangcmu/p/4121804.html
//http://www.cnblogs.com/yuzhangcmu/p/4121804.html
public static List<Integer> grayCode(int n) {
List<Integer> ret = new ArrayList<Integer>();
if (n == 0) {
ret.add(0);
return ret;
}
ret = grayCode(n - 1);
for (int i = ret.size() - 1; i >= 0; i--) {
int num = ret.get(i);
num += 1 << (n - 1);
ret.add(num);
}
return ret;
}