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

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.

分析：每增加一位，在原来数组上添加其对称数组，如00,01,11,10添加对称数组为00,01,11,10,10,11,01,00，然后再添加一位使后面添加的最高位为1，则变为000,001,011,010,110,111,101,100，符合要求

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> ret;
		ret.push_back(0);
		int highbit = 1;
		while(n--)
		{
			for(int i= highbit-1; i >= 0; i--)
				ret.push_back(highbit|ret[i]);
			highbit *= 2;
		}
		return ret;
    }
};