leetcode 随笔 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:

00 - 0
01 - 1
11 - 3
10 - 2

这个题是有规律的。

比如n=1 是0 1

n=2 是 00 01 11 10

n=3 是0+（00 01 11 10）1+（10 11 01 00）

每次在前面加上0，然后在加1反转序列

转换成数字逻辑也就很简单了，就是0+的部分相当于是不变，1+的部分加上相应的值即可。

class Solution {
public:
	vector<int> grayCode(int n) {
		vector<int> record;
        record.push_back(0); 
		if (n < 1) return record;
		record.push_back(1);
		for (int i = 2; i <= n; i++)
		{
			vector<int> tmp;
			int adder = 1 << (i-1);
			for (int j = 0; j < record.size(); j++)
			{
				tmp.push_back(record[j]);
			}
			for (int j = record.size() - 1; j >= 0; j--)
			{
				tmp.push_back(adder + record[j]);
			}
			record = tmp;
		}
		return record;
	}
};