class Solution {
public:
vector<int> grayCode(int n) {
vector<int> ans;
int size = 1 << n;
for(int i = 0; i < size; ++i)
ans.push_back((i >> 1)^i);
return ans;
}
};
LeetCode-Gray Code
最新推荐文章于 2021-08-27 21:40:34 发布