class Solution {
public:
vector<int> grayCode(int n){
vector<int> v;
v.push_back(0);
int head = 1;
for(int i = 0; i < n; i++){
for(int j = v.size() - 1; j >= 0; j--){
v.push_back(v[j] + head);
}
head = head << 1;
}
return v;
}
};
leetcode 89格雷编码
最新推荐文章于 2024-04-02 14:53:16 发布