Lexicographical Numbers LeetCode solution in JavaScript

1
/**
2
 * @param {number} n
3
 * @return {number[]}
4
 */
5
var lexicalOrder = function (n) {
6
  const arr = [];
7

8
  function dfs(baseIndex) {
9
    if (baseIndex * 10 > n) {
10
      return;
11
    }
12

13
    for (let i = baseIndex * 10; i < baseIndex * 10 + 10 && i <= n; i++) {
14
      arr.push(i);
15
      dfs(i);
16
    }
17
  }
18

19
  let stack = [];
20

21
  for (let i = 1; i <= 9 && i <= n; i++) {
22
    arr.push(i);
23
    dfs(i);
24
  }
25

26
  return arr;
27
};