[一起来刷leetcode吧][10]--No.89 Gray Code

最新推荐文章于 2021-03-09 11:07:11 发布

原创最新推荐文章于 2021-03-09 11:07:11 发布 · 124 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #leetcode #os

leetcode 同时被 2 个专栏收录

35 篇文章

订阅专栏

一起来刷leetcode吧

34 篇文章

订阅专栏

本文探讨了LeetCode第89题——格雷码的解决方案。介绍了格雷码的概念及特性，并提出了一种高效的生成算法，该算法避免了暴力求解的效率低下问题。通过对卡诺图规律的应用，实现了简洁快速的格雷码序列生成。

这篇文章是程序自动发表的,详情可以见这里
href="http://ounix1xcw.bkt.clouddn.com/github.markdown.css" rel="stylesheet">

这是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:0132 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. 思路最开始想到暴力求解：即每次求下一个数，都是列出所有可能，然后找最小的。结果TLE. 后来发现，这个顺序很像卡诺图，然后就找到规律了

show me the code

class Solution:
    def grayCode(self, n):
        """
        :type n: int
        :rtype: List[int]
        """
        karnaugh=[0]
        for i in range(n):
            karnaugh =[j 2**i for j in karnaugh[::-1]]
        return karnaugh