Package g2101_2200.s2165_smallest_value_of_the_rearranged_number

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2165 - Smallest Value of the Rearranged Number\.

    Medium

    You are given an integer num. Rearrange the digits of num such that its value is minimized and it does not contain any leading zeros.

    Return the rearranged number with minimal value.

    Note that the sign of the number does not change after rearranging the digits.

    Example 1:

    Input: num = 310

    Output: 103

    Explanation: The possible arrangements for the digits of 310 are 013, 031, 103, 130, 301, 310.

    The arrangement with the smallest value that does not contain any leading zeros is 103.

    Example 2:

    Input: num = -7605

    Output: -7650

    Explanation: Some possible arrangements for the digits of -7605 are -7650, -6705, -5076, -0567.

    The arrangement with the smallest value that does not contain any leading zeros is -7650.

    Constraints:

    • <code>-10<sup>15</sup><= num <= 10<sup>15</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 Long smallestNumber(Long num)

      • Methods inherited from class java.lang.Object

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