1
# Runtime: 68 ms (Top 17.05%) | Memory: 13.9 MB (Top 69.77%)
2
class Solution:
3
    def smallestNumber(self, num: int) -> int:
4
        lst = [i for i in str(num)]
5
        if num < 0:
6
            return "".join(["-"] + sorted(lst[1:], reverse=True))
7
        lst = sorted(lst)
8
        if "0" in lst:
9
            itr = 0
10
            while itr < len(lst) and lst[itr] == "0":
11
                itr += 1
12
            if itr == len(lst):  # All zeroes
13
                return "".join(lst)
14
            return "".join([lst[itr]] + lst[:itr] + lst[itr + 1 :])
15
        return "".join(lst)