-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path57_maxAbsoluteSum.py
More file actions
21 lines (21 loc) · 838 Bytes
/
57_maxAbsoluteSum.py
File metadata and controls
21 lines (21 loc) · 838 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
"""1749. Maximum Absolute Sum of Any Subarray
You are given an integer array nums. The absolute sum of a subarray
[numsl, numsl+1, ..., numsr-1, numsr] is abs(numsl + numsl+1 + ... + numsr-1 + numsr).
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."""
from typing import List
class Solution:
def maxAbsoluteSum(self, nums: List[int]) -> int:
minPre=maxPre=curr=res=0
for num in nums:
curr += num
res = max(res, abs(curr - minPre), abs(curr - maxPre))
minPre = min(minPre, curr)
maxPre = max(maxPre, curr)
return res