[LeetCode] Grey Code 格雷码

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.

http://fisherlei.blogspot.com/2012/12/leetcode-gray-code.html

http://www.lifeincode.net/programming/leetcode-gray-code-java/

[LeetCode] Grey Code 格雷码

原文：http://www.cnblogs.com/grandyang/p/4315649.html