leetcode

0 class Solution {

1 public:

2 vector<int> constructArray(int n, int k) const {

3 vector<int> res(n);

4 int idx = 0;

5 for (int i = 1; i < n - k; i++)

6 res[idx++] = i;

7 for (int i = 0; i <= k; i++) {

8 res[idx++] = i % 2 ? n - i / 2 : n - k + i / 2;

9 }

10 return res;

11 }

12 };