leetcode

0 class Solution {

1 public:

2 vector<int> grayCode(const int n) const {

3 const int k = 1 << n;

4 vector<int> res(k, 0);

5 for (int i = 0; i < k; i++) {

6 res[i] = i ^ (i >> 1);

7 }

8 return res;

9 }

10 };