[LeetCode]89. 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.

采用动态规划的方法，设定初始值为0，

当n = 1时，结果有初始值0，和初始值加上2^(n-1)，即n = 1时的结果为｛0,1｝；

当n = 2时，结果有 n-1 时的结果集合｛0,1｝，和该集合中的每个值加上2^(n-1)，即n = 2时的结果为｛2,3,0,1｝，且此结果能保证相邻两个数的二进制表示只有一位不同；

当n = 3时，结果为上一级结果集合｛2,3,0,1｝，和此集合中每一位加上2^(3-1)，即｛6,7,4,5,2,3,0,1｝

……

    代码如下：

    public List<Integer> grayCode(int n) {
        if (n == 0) {
            List<Integer> res = new ArrayList<Integer>(1);
        	res.add(0);
        	return res;
        }
    	List<ArrayList<Integer>> res = new ArrayList< ArrayList<Integer>>(n+1);
    	ArrayList<Integer> restemp = new ArrayList<Integer>(1);
    	restemp.add(0);
    	res.add(restemp);
    	for(int i = 1;i <n+1; i++){
    		ArrayList<Integer> r = new ArrayList<Integer>(2*res.get(i-1).size());
    		r.addAll(res.get(i-1));
    		int add = 1<<(i-1);
    		for(int j = add-1;j >= 0 ;j--) {
    			r.add(res.get(i-1).get(j)+add);
    		}
    		res.add(r);
    	}
    	return res.get(n);
    }