1749-maximum-absolute-sum-of-any-subarray.adoc

1749. Maximum Absolute Sum of Any Subarray

{leetcode}/problems/maximum-absolute-sum-of-any-subarray/[LeetCode - 1749. Maximum Absolute Sum of Any Subarray ^]

You are given an integer array nums. The absolute sum of a subarray [nums<sub>l</sub>, nums<sub>l+1</sub>, …​, nums<sub>r-1</sub>, nums<sub>r</sub>] is abs(nums<sub>l</sub> + nums<sub>l+1</sub> + …​ + nums<sub>r-1</sub> + nums<sub>r</sub>).

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 ⇐ 105

• -104 ⇐ nums[i] ⇐ 104

思路分析

一刷

link:{sourcedir}/_1749_MaximumAbsoluteSumOfAnySubarray.java[role=include]

参考资料