Maximum Absolute Sum of Any Subarray

lcpy gen -n 1749   # by problem number
lcpy gen -s maximum_absolute_sum_of_any_subarray   # by problem name

Input: nums = [1,-3,2,3,-4]
Output: 5

Input: nums = [2,-5,1,-4,3,-2]
Output: 8

class Solution:
    # Time: O(n)
    # Space: O(1)
    def max_absolute_sum(self, nums: list[int]) -> int:
        max_sum = 0
        min_sum = 0
        best = 0
        for num in nums:
            max_sum = max(max_sum + num, num)
            min_sum = min(min_sum + num, num)
            best = max(best, max_sum, -min_sum)
        return best