Lexicographical Numbers
Given an integer n, return all the numbers in the range [1, n] sorted in lexicographical order.
You must write an algorithm that runs in O(n) time and uses O(1) extra space.
Example 1
Input
n = 13Output
[1,10,11,12,13,2,3,4,5,6,7,8,9]The numbers from 1 to 13 in lexicographical order are [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9].
Example 2
Input
n = 2Output
[1,2]The numbers from 1 to 2 are already in lexicographical order.
Constraints
- 1 <= n <= 5 * 10^4