<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 smallestNumber(self, num: int) -> int:
        string = str(num)
        lst = [0] * 10
        ans = ""
        for char in string:
            if char == '-':
                continue
            lst[int(char)] += 1
        if num < 0:
            for idx, count in enumerate(lst[::-1]):
                while count:
                    char = str(9 - idx)
                    ans += char
                    count -= 1
            return int(ans) * -1
        else:
            # get my smallest not a zero
            idx = 1
            while idx < len(lst) and lst[idx] == 0:
                idx += 1
            if idx >= len(lst):
                return 0
            lst[idx] -= 1
            ans += str(idx)
            while lst[0]:
                # print(lst[0])
                lst[0] -= 1
                ans += '0'
            for idx, i in enumerate(lst):
                count = i
                while count:
                    ans += str(idx)
                    count -= 1
            return int(ans)
32