LeetCode----Gray Code

最新推荐文章于 2021-02-07 21:41:54 发布

白熊花田

最新推荐文章于 2021-02-07 21:41:54 发布

阅读量561

点赞数

CC 4.0 BY-SA版权

分类专栏：编程之美 Python LeetCode 文章标签：格雷码位运算 leetcode python

本文链接：https://blog.youkuaiyun.com/whiterbear/article/details/49126469

Python 同时被 3 个专栏收录

127 篇文章

订阅专栏

算法之美

95 篇文章

订阅专栏

编程之美

93 篇文章

订阅专栏

本文详细阐述了如何使用异或方式直接将二进制转换为灰码，并提供了相应的代码实现，通过实例展示了生成灰码序列的过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

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(object):
    def grayCode(self, n):
        """
        :type n: int
        :rtype: List[int]
        """
        if not n:
            return [0]
        res = []
        for a in range(2 << (n - 1)):
            res.append(a ^ (a >> 1))
        return res