【LeetCode】19.Gray Code

题目描述(Medium)

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.

题目链接

https://leetcode.com/problems/gray-code/description/

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].

算法分析

方法一：先执行反射，再对前缀进行或操作；

方法二：公式法，整数n的格雷码是

提交代码：

class Solution {
public:
	// 方法一:反射后加前缀
	vector<int> grayCode(int n) {
		vector<int> result;
		result.reserve(1 << n);
		result.push_back(0);
		for (int i = 0; i < n; ++i)
		{
			const int highest = 1 << i;
			for (int j = result.size() - 1; j >= 0; --j)
				result.push_back(highest | result[j]);
		}

		return result;
	}
};

测试代码：

class Solution {
public:
	// 方法二:公式法
	vector<int> grayCode(int n) {
		vector<int> result;
		const int size = 1 << n;
		result.reserve(size);
		for (int i = 0; i < size; ++i)
			result.push_back(i ^ (i >> 1));

		return result;
	}
};