问题
https://leetcode.com/problems/gray-code/
解法
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> ret;
for (int i=0; i< (1<<n); ++i)
{
ret.push_back(i^(i>>1));
}
return ret;
}
};