leetcode

0 class Solution {

1 public:

2 vector<int> beautifulArray(int n) {

3 vector<int> res = {1};

4 while (res.size() < n) {

5 vector<int> tmp;

6 for (int i : res)

7 if (i * 2 - 1 <= n) tmp.push_back(i * 2 - 1);

8 for (int i : res)

9 if (i * 2 <= n) tmp.push_back(i * 2);

10 res = tmp;

11 }

12 return res;

13 }

14 };