Gray Code

發表於   |   分類於

Gray 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:

1
2
3
4
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.

DFS。

注意对数组遍历的时候应该逆序。

AC代码：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
class Solution {
public:

	void solve(int n, vector<int>& r)
	{
		if (0 == n)
		{
			r.push_back(0);
			return;
		}
		else if (1 == n)
		{
			r.push_back(0);
			r.push_back(1);
			return;
		}
		solve(n - 1, r);
		int lv = 1 << (n - 1);
		int size = r.size();
		for (int i = size - 1; i >= 0; --i)
		{
			r.push_back(r[i] + lv);
		}
	}

	vector<int> grayCode(int n) {
		vector<int> result;
		if (n < 0) return result;
		solve(n, result);
		return result;
	}
};