1.问题描述

对于给定的正整数n，格雷码为满足如下条件的一个编码序列：

(1) 序列由2n个编码组成，每个编码都是长度为n的二进制位串。

(2) 序列中无相同的编码。

(3) 序列中位置相邻的两个编码恰有一位不同。

例如：n=2时的格雷码为：{00, 01, 11, 10}。

-1. Problem Descr iption for a given positive integer n, Gray code to meet a coding sequence of the following conditions: (1) a coding sequence of the 2n, each code is of length n binary bit string. (2) without the same coding sequence. (3) position of the sequence adjacent to exactly one of two different codes. For example: n = 2 when the Gray code is: (00, 01, 11, 10).