Smallest Value of the Rearranged Number
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 = 310Output
103The arrangement with the smallest value that does not contain any leading zeros is 103.
Example 2
Input
num = -7605Output
-7650The arrangement with the smallest value that does not contain any leading zeros is -7650.
Constraints
- -10^15 <= num <= 10^15