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.

我的思路：

        gray code是一个二进制数的系统，连续的两个值只有1位不一样。给吃一个非负数n，返回它的gray code序列。

        主要是找到规律，对于n都可以用n-1的结果，把n-1中每个元素倒序加上2^(n-1)，然后添加到结果中。

我的代码：

class Solution:
    def grayCode(self, n):
        """
        :type n: int
        :rtype: List[int]
        """
        rel = [0]
        for i in range(n):
            tmp = []
            for x in reversed(rel):
                x += pow(2, i)
                tmp.append(x)
            rel += tmp
        return rel

Discuss：

public List<Integer> grayCode(int n) {
    List<Integer> result = new LinkedList<>();
    for (int i = 0; i < 1<<n; i++) result.add(i ^ i>>1);
    return result;
}

学到：

        对于这种问题，可以考虑下左移，右移运算。Discuss中的方法很巧妙。

        用i和i>>1异或正好可以得出和上一位只差一位的数。