[Leetcode] 386. Lexicographical Numbers

[rmorabia]

Given an integer n, return 1 - n in lexicographical order.

For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].

Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000.

[rmorabia]

var lexicalOrder = function(n) {
  const allNumbers = []
  const finalNumbers = []
  for (let i = 1; i < n+1; i++) {
      allNumbers.push(i.toString())
  }
  allNumbers.sort()
  for (let z = 0; z < allNumbers.length; z++) {
    finalNumbers.push(Number(allNumbers[z]))
  }
  return finalNumbers
};

Time Complexity: O(n)

Pretty happy with this. This literally only took me 20 minutes and one quick Google search to confirm the Number() syntax.