Maximum Absolute Sum of Any Subarray
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
xis a negative integer, thenabs(x) = -x. - If
xis a non-negative integer, thenabs(x) = x.
Example 1
Input
nums = [1,-3,2,3,-4]Output
5The subarray [2, 3] has absolute sum = abs(2 + 3) = abs(5) = 5.
Example 2
Input
nums = [2,-5,1,-4,3,-2]Output
8The subarray [-5, 1, -4] has absolute sum = abs(-5 + 1 - 4) = abs(-8) = 8.
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4