码迷,mamicode.com
首页 > 其他好文 > 详细

24-89. Gray Code

时间:2019-06-15 10:19:06      阅读:113      评论:0      收藏:0      [点我收藏+]

标签:size   for   ESS   integer   xpl   nbsp   题目   als   NPU   

题目描述:

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.

Example 1:

Input: 2
Output: [0,1,3,2]
Explanation:
00 - 0
01 - 1
11 - 3
10 - 2

For a given n, a gray code sequence may not be uniquely defined.
For example, [0,2,3,1] is also a valid gray code sequence.

00 - 0
10 - 2
11 - 3
01 - 1

Example 2:

Input: 0
Output: [0]
Explanation: We define the gray code sequence to begin with 0.
             A gray code sequence of n has size = 2n, which for n = 0 the size is 20 = 1.
             Therefore, for n = 0 the gray code sequence is [0].

代码实现:

技术图片

运行结果:

技术图片

24-89. Gray Code

标签:size   for   ESS   integer   xpl   nbsp   题目   als   NPU   

原文地址:https://www.cnblogs.com/tbgatgb/p/11026026.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!