Maximum Absolute Sum of Any Subarray LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxAbsoluteSum(vector<int> &nums) {
4
    int mx1 = 0;
5
    int sum = 0;
6
    for (int i = 0; i < nums.size(); i++) {
7
      sum += nums[i];
8
      if (sum < 0) sum = 0;
9
      mx1 = max(sum, mx1);
10
    }
11
    sum = 0;
12
    int mx2 = 0;
13
    for (int i = 0; i < nums.size(); i++) {
14
      sum += nums[i];
15
      if (sum >= 0) sum = 0;
16
      mx2 = min(sum, mx2);
17
    }
18

19
    return max(mx1, abs(mx2));
20
  }
21
};