Maximum Absolute Sum of Any Subarray LeetCode solution in Java

1
class Solution {
2
  public int maxAbsoluteSum(int[] nums) {
3
    int minSum = Integer.MAX_VALUE,
4
        maxSum = Integer.MIN_VALUE,
5
        currentMinSum = 0,
6
        currentMaxSum = 0;
7
    for (int num : nums) {
8
      currentMaxSum += num;
9
      maxSum = Math.max(maxSum, currentMaxSum);
10
      if (currentMaxSum < 0) currentMaxSum = 0;
11

12
      currentMinSum += num;
13
      minSum = Math.min(minSum, currentMinSum);
14
      if (currentMinSum > 0) currentMinSum = 0;
15
    }
16
    return Math.max(maxSum, -minSum);
17
  }
18
}