forked from prateekshyap/DSA
-
Notifications
You must be signed in to change notification settings - Fork 0
/
SmallestValueOfTheRearrangedNumber.java
45 lines (44 loc) · 1.32 KB
/
SmallestValueOfTheRearrangedNumber.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
/*https://leetcode.com/problems/smallest-value-of-the-rearranged-number/*/
class Solution {
public long smallestNumber(long num) {
if (num < 0)
{
ArrayList<Integer> digits = new ArrayList<Integer>();
num *= -1;
while (num > 0)
{
digits.add((int)(num%10));
num /= 10;
}
Collections.sort(digits);
StringBuilder result = new StringBuilder("");
for (int digit : digits)
{
result.append(digit);
}
result.reverse();
return -1*Long.parseLong(result.toString());
}
else if (num > 0)
{
ArrayList<Integer> digits = new ArrayList<Integer>();
while (num > 0)
{
digits.add((int)(num%10));
num /= 10;
}
Collections.sort(digits);
StringBuilder result = new StringBuilder("");
int zeroCount = 0;
for (int digit : digits)
{
if (digit == 0) ++zeroCount;
else result.append(digit);
}
while (zeroCount-- > 0)
result.insert(1,"0");
return Long.parseLong(result.toString());
}
else return 0;
}
}