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

<p>Return <em>the rearranged number with minimal value</em>.</p>

<p>Note that the sign of the number does not change after rearranging the digits.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> num = 310
<strong>Output:</strong> 103
<strong>Explanation:</strong> 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.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> num = -7605
<strong>Output:</strong> -7650
<strong>Explanation:</strong> 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.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>-10<sup>15</sup> &lt;= num &lt;= 10<sup>15</sup></code></li>
</ul>

class Solution:

    def digits(self, num: int):
        if num == 0:
            return [0]
            
        res = []

        while num:
            num, r = divmod(num, 10)
            res.append(r)
        
        return res
    
    def build(self, digits: list[int]):
        res = 0

        for i in range(len(digits)-1, -1, -1):
            res += digits[i] * (10 ** (len(digits) -1 -i))
        
        return res

    def smallestNumber(self, num: int) -> int:
        ds = self.digits(abs(num))
        
        if num < 0:
            ds.sort(reverse=True)

            return -self.build(ds)
        
        ds.sort()

        if ds[0] == 0:
            i = 0
            while i < len(ds) and ds[i] == 0:
                i += 1
            
            if i == len(ds):
                return 0
            
            ds[0], ds[i] = ds[i], 0
        
        return self.build(ds)


21