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.

做本题前，先理解一个叫“格雷码”的概念， 相邻两个二进制数只能在一位上有差异。以n=3为例

第一位

000  0

001  1

第二位是接着第一位来的

000  0

001  1

011  3

010  2

第三位接着第二位

000  0

001  1

011  3

010  2

110  6

111  7

101  5

100  4

发现一个什么规律没，在一个周期中是倒序与2的幂相加。

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