原理参考https://blog.csdn.net/qq_17550379/article/details/83572902
https://blog.csdn.net/lwgkzl/article/details/83502656
class Solution {
public:
vector<int> beautifulArray(int N) {
vector<int> temp={1};
vector<int> x;
while(temp.size()<N)
{
for(auto i:temp)
if(i*2-1 <= N && x.size()<N) x.push_back(i*2-1);
for(auto i:temp)
if(i*2 <= N && x.size()<N) x.push_back(i*2);
temp=x;
x.clear();
}
return temp;
}
};