class Solution {
public:
vector<int> grayCode(int n) {
int size = 1 << n;
vector<int> r;
for(int i = 0;i<size;i++)
{
int tmp = i^(i>>1);
r.push_back(tmp);
}
return r;
}
};
LeetCode || Gray Code
最新推荐文章于 2024-03-21 23:32:26 发布