LeetCode 1749 Maximum Absolute Sum of Any Subarray (dp)

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.

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

题目链接：https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/

题目大意：求最大的连续和的绝对值

题目分析：求最大最小连续和即可

3ms，时间击败92.71%

class Solution {
    public int maxAbsoluteSum(int[] nums) {
        int curMi = 0, curMa = 0, ma = Integer.MIN_VALUE, mi = Integer.MAX_VALUE;
        for (int num : nums) {
            if (curMa + num <= 0) {
                curMa = 0;
            } else {
                curMa += num;
            }
            if (curMi + num >= 0) {
                curMi = 0;
            } else {
                curMi += num;
            }
            ma = Math.max(curMa, ma);
            mi = Math.min(curMi, mi);
        }
        return Math.max(ma, -mi);
    }
}