1
class Solution {
2
 public:
3
  long long smallestNumber(long long num) {
4
    if (num < 0) {
5
      string s = to_string(-num);
6
      sort(s.rbegin(), s.rend());
7
      return -stoll(s);
8
    } else if (num == 0)
9
      return 0;
10
    string s = to_string(num);
11
    sort(s.begin(), s.end());
12
    int i = 0;
13
    while (s[i] == '0') i++;
14
    char c = s[i];
15
    s.erase(s.begin() + i);
16
    s = c + s;
17
    return stoll(s);
18
  }
19
};