Minimum Sum of Four Digit Number After Splitting Digits LeetCode solution in Java

1
class Solution {
2
  public int minimumSum(int num) {
3
    int[] dig = new int[4]; // For each digit
4
    int cur = 0;
5
    while (num > 0) // Getting each digit
6
    {
7
      dig[cur++] = num % 10;
8
      num /= 10;
9
    }
10
    Arrays.sort(dig); // Ascending order
11
    int num1 = dig[0] * 10 + dig[2]; // 1st and 3rd digit
12
    int num2 = dig[1] * 10 + dig[3]; // 2nd and 4th digit
13
    return num1 + num2;
14
  }
15
}