# 【leetcode】【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.

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.

### 三、Java AC 代码

public List<Integer> grayCode(int n) {
ArrayList<Integer> list = new ArrayList<Integer>();
for (int i = 0; i < n; i++) {
int highest = 1 << i;
for(int j = list.size()-1;j>=0;j--){
}
}
return list;
}

public List<Integer> grayCode(int n) {
if (n==0) {
List<Integer> list = new ArrayList<Integer>();
return list;
}
List<Integer> list = grayCode(n-1);
int highest = 1 << (n-1);
for (int i = list.size()-1; i >= 0; i--) {
}
return list;
}

#### LeetCode89:Gray Code

2015-07-07 15:59:59

#### LeetCode --- 89. Gray Code

2015-04-07 21:55:12

#### 【Leetcode】：89. Gray Code 问题 in JAVA

2016-05-10 14:04:39

#### LeetCode(89)GrayCode

2014-02-14 08:07:30

#### [leetcode-89]Gray Code(c++)

2015-08-09 21:49:28

#### leetCode 89.Gray Code （格雷码） 解题思路和方法

2015-07-25 09:48:24

#### leetcode——89——Gray Code

2016-04-19 21:51:10

#### LeetCode 89 Gray Code

2015-03-27 02:11:26

#### Gray Code（Leetcode 89）

2015-11-30 11:42:02

#### [leetcode] #89 Gray Code

2015-05-18 15:49:17