LeetCode: Beautiful Arrangement II Solution

1/**
2 * @param {number} n
3 * @param {number} k
4 * @return {number[]}
5 */
6var constructArray = function (n, k) {
7  const res = []
8  let from = 1
9  let to = k + 1
10
11  while (from <= to) {
12    res.push(from++)
13    from <= to && res.push(to--)
14  }
15  for (let i = k + 2; i <= n; i++) {
16    res.push(i)
17  }
18
19  return res
20}