Leetcode 1749. Maximum Absolute Sum of Any Subarray

class Solution:
    def maxAbsoluteSum(self, nums: List[int]) -> int:
        n = len(nums)
        pos = 0
        neg = 0
        maximum = 0
        for i in range(n):
            pos += nums[i]
            neg += nums[i]
            maximum = max(maximum, abs(pos), abs(neg))
            pos = max(0, pos)
            neg = min(0, neg)
        return maximum