LeetCode 89. Gray Code（格雷码生成）

题目来源：https://leetcode.com/problems/gray-code/

问题描述

89. Gray Code

Medium

The gray code is a binary numeral system where two successive values differ in only one bit.

Given a non-negative integer nrepresenting the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0.

Example 1:

Input: 2

Output: [0,1,3,2]

Explanation:

00 - 0

01 - 1

11 - 3

10 - 2

 

For a given n, a gray code sequence may not be uniquely defined.

For example, [0,2,3,1] is also a valid gray code sequence.

 

00 - 0

10 - 2

11 - 3

01 - 1

Example 2:

Input: 0

Output: [0]

Explanation: We define the gray code sequence to begin with 0.

             A gray code sequence of n has size = 2n, which for n = 0 the size is 20 = 1.

             Therefore, for n = 0 the gray code sequence is [0].

------------------------------------------------------------

题意

生成格雷码。格雷码是指只有一个二进制为不同的n位二进制码序列。

------------------------------------------------------------

思路

【解法1】

递归，n位格雷码由n-1位格雷码一部分首位+0，另一部分倒序首位+1。图来源于https://blog.csdn.net/qq_22980439/article/details/51072294。

【解法2】

根据index直接生成，方法见代码。给出了一个3位格雷码生成的例子。

000 ^ 000 = 000	[0]
001 ^ 000 = 001	[1]
010 ^ 001 = 011	[3]
011 ^ 001 = 010	[2]
100 ^ 010 = 110	[6]
101 ^ 010 = 111	[7]
110 ^ 011 = 101	[5]
111 ^ 011 = 100	[4]

------------------------------------------------------------

代码

【解法1】

class Solution {
    public List<Integer> grayCode(int n) {
        if (n == 0)
        {
            List<Integer> ret = new ArrayList<Integer>();
            ret.add(0);
            return ret;
        }
        int bit = (1<<(n-1));
        List<Integer> pre = grayCode(n-1);
        for (int i=1, L=pre.size(); i<=L; i++)
        {
            pre.add(bit+pre.get(L-i));
        }
        return pre;
    }
}

【解法2】

class Solution {
    public List<Integer> grayCode(int n) {
    int count = (int)Math.pow(2,n);
    List<Integer> res = new ArrayList<>();
    for(int i = 0; i < count; i++){
        res.add((i) ^ (i >> 1));
    }
    return res;
    }
}