leetcode oj java 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.

二、解决方案：

结果为re[] 观察一下N=4的时候：可以发现

 re[0]=0,re[1]=1; re[2] = re[1]+2; re[3] = re[1]+2。。。。。。

假设i的以2为底的整数结果为k, 即： re[i] = re[2^k-1] + 2^(k-1)

三、代码：

package T12;

import java.util.ArrayList;
import java.util.List;

/**
 * @author 作者 : xcy
 * @version 创建时间：2016年12月20日 上午9:57:57
 *          类说明
 */
public class t89 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int n = 1;
        List<Integer> re = grayCode(n);
        System.out.println("end!");

    }

    public static List<Integer> grayCode(int n) {
        List<Integer> re = new ArrayList<Integer>();
        re.add(0);
        if (n == 0) {
            return re;
        }
        re.add(1);
        int num = (int) Math.pow(2, n);
        int tmp = 0;
        int add = 0;
        for (int i = 2; i < num; i++) {
            tmp = nTwo(i);
            int id = (int) Math.pow(2, tmp) - 1 - i;
            add = (int) (re.get(id) + Math.pow(2, tmp - 1));
            re.add(add);
        }
        return re;
    }

    public static int nTwo(int n) {
        int re = 0;
        while (n > 0) {
            n = n / 2;
            re++;
        }
        return re;
    }
}