前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >leetcode: 89. Gray Code

leetcode: 89. Gray Code

作者头像
JNingWei
发布2018-09-27 16:24:14
3500
发布2018-09-27 16:24:14
举报
文章被收录于专栏:JNing的专栏

Problem

代码语言:javascript
复制
# 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.

AC

代码语言:javascript
复制
class Solution():
    def grayCode(self, n):
        return [i >> 1 ^ i for i in range(1 << n)]


if __name__ == "__main__":
    assert Solution().grayCode(0) == [0]
    assert Solution().grayCode(2) == [0, 1, 3, 2]
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2017年11月22日,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • Problem
  • AC
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档