#1749

Maximum Absolute Sum of Any Subarray

pupil · 540 · lc medium +28 · verified · 71.2% accepted · 1,990 likes · top 80%

Description

You are given an integer array nums. The absolute sum of subarray [numsl, ..., numsr] is abs(numsl + ... + numsr). Return the maximum absolute sum over all possibly-empty subarrays. Here abs(x) = -x if x < 0, else 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.

Code

1

2

3

class Solution:
    def maxAbsoluteSum(self, nums: List[int]) -> int:

class Solution:
    def maxAbsoluteSum(self, nums: List[int]) -> int: