Gray Code

仔细观察格雷码
当n=1时

1
0

当n=2时

00
01
11
10

当n=3时

000
001
011
010
110
111
101
100

可以发现，n的格雷码，就是n-1的格雷码，再加上它们的逆序前面多一个1

两种做法。

public class Solution {
    public List<Integer> grayCode(int n) {
        List<Integer> list = new LinkedList<>();
        list.add(0);
        for (int i = 0; i < n; i++) {
            int highbit = 1 << i;
            int size = list.size();
            for (int j = size - 1; j >= 0; j--) {
                list.add(highbit + list.get(j));
            }
        }
        return list;
    }
    // public List<Integer> grayCode(int n) {
    //     if (n == 0) {
    //         List<Integer> list = new LinkedList<>();
    //         list.add(0);
    //         return list;
    //     }
    //     List<Integer> list = grayCode(n - 1);
    //     int addNum = 1 << (n - 1);
    //     int size = list.size();
    //     for (int i = size - 1; i >= 0; i--) {
    //         int num = addNum + list.get(i);
    //         list.add(num);
    //     }
    //     return list;
    // }
}

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.

Hide Company Tags