Beautiful Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> beautifulArray(int n) {
4
    vector<int> v = {1};
5

6
    while (v.size() < n) {
7
      vector<int> x;
8

9
      for (auto c : v) {
10
        if (c * 2 - 1 <= n) {
11
          x.push_back(c * 2 - 1);
12
        }
13
      }
14

15
      for (auto d : v) {
16
        if (d * 2 <= n) {
17
          x.push_back(d * 2);
18
        }
19
      }
20
      v = x;
21
    }
22

23
    return v;
24
  }
25
};