Package g0301_0400.s0386_lexicographical_numbers

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    386 - Lexicographical Numbers\.

    Medium

    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 = 13

    Output: 1,10,11,12,13,2,3,4,5,6,7,8,9

    Example 2:

    Input: n = 2

    Output: 1,2

    Constraints:

    • <code>1 <= n <= 5 * 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<Integer> lexicalOrder(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait