【Leetcode】89. Gray Code 【递归】

参考自：http://blog.csdn.net/feliciafay/article/details/19187943

89. Gray Code

• Total Accepted: 67930
• Total Submissions: 179730
• Difficulty: Medium

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 =0, 1,2,3的输出结果。

1) n = 0 

    output =   0

                 

2) n = 1

   output =  00

                  01

                  11

                  10

3) n = 3

   output =  000

                  001

                  011

                  010

                  110
                  111
                  101
                  100

规律：后n-1位是上一次的结果，正序 + 逆序 。 最终结果为  0 + 正序  1 + 逆序 。

代码：

import java.math.*;
public class Solution {
    public List<Integer> grayCode(int n) {
        List<Integer> res = new ArrayList<Integer>();
        if(n == 0){
            res.add(0);
            return res;
        }
        List<Integer> res_last = grayCode(n-1);
        int len = res_last.size();
        for(int i = 0 ; i <= len - 1 ; i ++){
            res.add(res_last.get(i));
        }
        for(int i = len - 1 ; i >= 0 ; i --){
            res.add((int)(res_last.get(i) + Math.pow(2,n-1)));
        }
        return res;
    }
}