《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+1)为的格雷码的前一半为是n位的全部格雷码在前面一位加零拼凑所得，后面一半为n位格雷码（从后往前）在前面一位加1拼凑所得。

实现代码如下：

public class Solution {
    public List<Integer> grayCode(int n) {
        if(n<0) return new ArrayList<Integer>();
        if(n==0) {
            List<Integer> l=new ArrayList<Integer>();
            l.add(0);
            return l;
        }
        //如果n>0,则直接利用递归来求解
        List<Integer> temp=grayCode(n-1);
        List<Integer> result=new ArrayList<Integer>(temp);
        int value=1<<(n-1);
        for(int i=temp.size()-1;i>=0;i--){//从后往前
            result.add(value+temp.get(i));
        }
        return result;


    }
}