Gray Code 原题地址:
https://oj.leetcode.com/problems/gray-code/
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.
格雷码有个特点,可以往多写一写:000;001;011;010;110;111;101;100
去除每个数第一个字符后两边是对称的。
public class Solution {
public List<Integer> grayCode(int n) {
if (n == 0) {
List<Integer> result = new ArrayList<Integer>();
result.add(0);
return result;
}
List<Integer> tmp = grayCode(n-1);
int addNumber = 1 << (n-1);
ArrayList<Integer> result = new ArrayList<Integer>(tmp);
for (int i = tmp.size() - 1; i >= 0; i--) {
result.add(addNumber + tmp.get(i));
}
return result;
}
}