[leetcode] 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.

思路： 这道题需要找格雷码的规律，以n=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位先是全0，然后全1，而且前n-1位就是n-1位的格雷码序列，而以1开头的则为n-1位格雷码的倒序，所以很容易写出代码

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);
        List<Integer> result = new ArrayList<Integer>();
        int num = 1 << (n-1);
        for(Integer i : tmp){
            result.add(i);
        }
        for(int j = tmp.size() - 1; j >= 0; j--){
            result.add(tmp.get(j)+num);
        }
        return result;
    }
}