# 【leetcode】【89】Gray Code

143人阅读 评论(0)

### 一、问题描述

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;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：34383次
• 积分：1882
• 等级：
• 排名：千里之外
• 原创：157篇
• 转载：23篇
• 译文：0篇
• 评论：1条
阅读排行
评论排行
最新评论