LeetCode 89 Gray Code

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.

class Solution:
    # @return a list of integers
    def grayCode(self, n):
        a =[[0] for x in range(n+1)]
        for i in range(1,n+1):
            a[i] = a[i-1] + list(x + 2**(i-1) for x in a[i-1][::-1])
        return a[n]

LeetCode 89 Gray Code

原文：http://blog.csdn.net/felixtsui/article/details/44665597