题目:
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.
题意:
格雷码是二进制数字系统,其中,两个连续值仅在一个比特上不同。
给定一个非负整数n来表示码的总位数,打印出格雷码的序列。格雷码序列都是以0开始的。
比如, 给定 n = 2, 返回 [0,1,3,2]
. 它的格雷码的序列为:
00 - 0
01 - 1
11 - 3
10 - 2
注意:
对于给定的 n ,它的格雷码不是唯一定义的。
比如,根据上述定义[0,2,3,1]同样也是一个有效的格雷码序列。
算法分析:
* 其实这道题的正解是找规律:
以3位格雷码为例。
0 0 0
0 0 1 ======>> n-1位格雷码
0 1 1
0 1 0
-------------------
1 1 0
1 1 1 ======>> 1<<(n-1)即为 (1<<2)==100 + n-1位格雷码的逆序即为(10 11 01 00)
1 0 1
1 0 0
可以看到第n位的格雷码由两部分构成,一部分是n-1位格雷码,再加上 1<<(n-1)和n-1位格雷码的逆序的和。
AC代码:
public class Solution
{
public ArrayList<Integer> grayCode(int n)
{
if(n==0)
{
ArrayList<Integer> result = new ArrayList<Integer>();
result.add(0);
return result;
}
ArrayList<Integer> tmp = grayCode(n-1);//n-1位格雷码
int addNumber = 1 << (n-1); //n-1位格雷码 左移一位
ArrayList<Integer> result = new ArrayList<Integer>(tmp);
for(int i=tmp.size()-1;i>=0;i--) //逆序取 n-1 位的格雷码
{
result.add(addNumber + tmp.get(i));
}
return result;
}
}