【LeetCode题解】89. Gray Code （Java）

（一）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.

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的变化，结果集也是规律变化的：
  • n = 0时， 0
  • n = 1时，（0），（1）
  • n = 2时，（00,01）， （10,11）
  • n = 3时，（000,001,010,011），（100,101,110,111）
• 也就是说，每当n+1，则对原来数组中所有的数的首位插入1即可，同时造成数据扩大2倍
  • 所以dp转移方程： dp[k] = (1 << n) | dp[k-1]，其中2^(n-1) <= k < 2^n，（1<<n）表示首位为1其他为0的二进制数

package DynamicProgramming.GrayCode;

import java.util.ArrayList;

public class Solution {
	public static ArrayList<Integer> grayCode(int n) {
		ArrayList<Integer> arr = new ArrayList<Integer>(1 << n);
		arr.add(0);
		for(int i=0; i < n; i++){
			int high_bit = 1 << i;
			for(int j = arr.size()-1; j>=0; j--){
				arr.add(high_bit | arr.get(j));
			}
		}
		return arr;
	}

	public static void main(String[] args){
		System.out.println(grayCode(2)); 
	}
}