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

刚开始妄图通过遍历来找规律，后来不知怎么突然想到了这个递归的办法，真是太精妙了

    vector<int> grayCode(int n) 
	{
		vector<int> result;
		if (n < 0) return result;		
		result.push_back(0);
		if (n == 0) return result;


		for (int i = 1; i <= n; i++)
		{
			int offset = std::pow(2, i-1);
			for (int j = result.size() - 1; j >= 0; j--)
			{
				result.push_back(result[j] + offset);
			}
		}
		return result;
    }