Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g1701_1800.s1749_maximum_absolute_sum_of_any_subarray.Solution

```
public class Solution
extends Object
```
1749 - Maximum Absolute Sum of Any Subarray.
Medium

You are given an integer array nums. The absolute sum of a subarray [nums_l, nums_l+1, …, nums_r-1, nums_r] is abs(nums_l + nums_l+1 + … + nums_r-1 + nums_r).

Return the maximum absolute sum of any (possibly empty) subarray of nums.

Note that abs(x) is defined as follows:
- If x is a negative integer, then abs(x) = -x.
- If x is a non-negative integer, then abs(x) = x.
Example 1:

Input: nums = [1,-3,2,3,-4]

Output: 5

Explanation: The subarray [2,3] has absolute sum = abs(2+3) = abs(5) = 5.

Example 2:

Input: nums = [2,-5,1,-4,3,-2]

Output: 8

Explanation: The subarray [-5,1,-4] has absolute sum = abs(-5+1-4) = abs(-8) = 8.

Constraints:
- 1 <= nums.length <= 10⁵
- -10⁴ <= nums[i] <= 10⁴

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int maxAbsoluteSum(int[] nums)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

maxAbsoluteSum

public int maxAbsoluteSum(int[] nums)