Lexicographical Numbers - Leetcode 368 - Java

Problem Description
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.
Problem: leetcode.com/p...
Code link: k5kc.com/cs/al...