Lintcode 411. Gray Code (Medium) (Python)

本文介绍了一种生成格雷码序列的方法,通过一种简单的位运算实现。格雷码是一种二进制数系统,在该系统中两个连续的数值仅有一位不同。文章提供了一个Python类方法,该方法接收一个整数n作为参数,返回一个长度为2^n的格雷码序列。

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

Gray Code

Description:

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, find the sequence of gray code. A gray code sequence must begin with 0 and with cover all 2n integers.

Example
Given n = 2, return [0,1,3,2]. Its gray code sequence is:

00 - 0
01 - 1
11 - 3
10 - 2
Challenge
O(2n) time.

Notice
For a given n, a gray code sequence is not uniquely defined.

[0,2,3,1] is also a valid gray code sequence according to the above definition.

Code:

class Solution:
    """
    @param n: a number
    @return: Gray code
    """
    def grayCode(self, n):
        # write your code here
        return [(i>>1)^i for i in range(2**n)]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值