gray-code

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

An n-bit gray code sequence is a sequence of <code>2n</code> integers where:

<ul>
	<li>Every integer is in the inclusive range <code>[0, 2n - 1]</code>,</li>
	<li>The first integer is <code>0</code>,</li>
	<li>An integer appears no more than once in the sequence,</li>
	<li>The binary representation of every pair of adjacent integers differs by exactly one bit, and</li>
	<li>The binary representation of the first and last integers differs by exactly one bit.</li>
</ul>

Given an integer <code>n</code>, return any valid n-bit gray code sequence.

&nbsp;
Example 1:

<pre>
Input: n = 2
Output: [0,1,3,2]
Explanation:
The binary representation of [0,1,3,2] is [00,01,11,10].
- 00 and 01 differ by one bit
- 01 and 11 differ by one bit
- 11 and 10 differ by one bit
- 10 and 00 differ by one bit
[0,2,3,1] is also a valid gray code sequence, whose binary representation is [00,10,11,01].
- 00 and 10 differ by one bit
- 10 and 11 differ by one bit
- 11 and 01 differ by one bit
- 01 and 00 differ by one bit
</pre>

Example 2:

<pre>
Input: n = 1
Output: [0,1]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 16</code></li>
</ul>

grayCode

Gray Code

1-bit and 2-bit Characters

1-bit-and-2-bit-characters

1 比特与 2 比特字符

Bit Manipulation

Math

Backtracking

n &#20301;&#26684;&#38647;&#30721;&#24207;&#21015; &#26159;&#19968;&#20010;&#30001; <code>2n</code> &#20010;&#25972;&#25968;&#32452;&#25104;&#30340;&#24207;&#21015;&#65292;&#20854;&#20013;&#65306;
<ul>
	<li>&#27599;&#20010;&#25972;&#25968;&#37117;&#22312;&#33539;&#22260; <code>[0, 2n - 1]</code> &#20869;&#65288;&#21547; <code>0</code> &#21644; <code>2n - 1</code>&#65289;</li>
	<li>&#31532;&#19968;&#20010;&#25972;&#25968;&#26159; <code>0</code></li>
	<li>&#19968;&#20010;&#25972;&#25968;&#22312;&#24207;&#21015;&#20013;&#20986;&#29616; &#19981;&#36229;&#36807;&#19968;&#27425;</li>
	<li>&#27599;&#23545; &#30456;&#37051; &#25972;&#25968;&#30340;&#20108;&#36827;&#21046;&#34920;&#31034; &#24688;&#22909;&#19968;&#20301;&#19981;&#21516; &#65292;&#19988;</li>
	<li>&#31532;&#19968;&#20010; &#21644; &#26368;&#21518;&#19968;&#20010; &#25972;&#25968;&#30340;&#20108;&#36827;&#21046;&#34920;&#31034; &#24688;&#22909;&#19968;&#20301;&#19981;&#21516;</li>
</ul>

&#32473;&#20320;&#19968;&#20010;&#25972;&#25968; <code>n</code> &#65292;&#36820;&#22238;&#20219;&#19968;&#26377;&#25928;&#30340; n &#20301;&#26684;&#38647;&#30721;&#24207;&#21015; &#12290;

&nbsp;

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;n = 2
&#36755;&#20986;&#65306;[0,1,3,2]
&#35299;&#37322;&#65306;
[0,1,3,2] &#30340;&#20108;&#36827;&#21046;&#34920;&#31034;&#26159; [00,01,11,10] &#12290;
- 00 &#21644; 01 &#26377;&#19968;&#20301;&#19981;&#21516;
- 01 &#21644; 11 &#26377;&#19968;&#20301;&#19981;&#21516;
- 11 &#21644; 10 &#26377;&#19968;&#20301;&#19981;&#21516;
- 10 &#21644; 00 &#26377;&#19968;&#20301;&#19981;&#21516;
[0,2,3,1] &#20063;&#26159;&#19968;&#20010;&#26377;&#25928;&#30340;&#26684;&#38647;&#30721;&#24207;&#21015;&#65292;&#20854;&#20108;&#36827;&#21046;&#34920;&#31034;&#26159; [00,10,11,01] &#12290;
- 00 &#21644; 10 &#26377;&#19968;&#20301;&#19981;&#21516;
- 10 &#21644; 11 &#26377;&#19968;&#20301;&#19981;&#21516;
- 11 &#21644; 01 &#26377;&#19968;&#20301;&#19981;&#21516;
- 01 &#21644; 00 &#26377;&#19968;&#20301;&#19981;&#21516;
</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;n = 1
&#36755;&#20986;&#65306;[0,1]
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= n &lt;= 16</code></li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support