Solving Lexicographical Numbers in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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.

See the full details of the problem Lexicographical Numbers at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go