leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

max_abs_sum_any_subarr.c (891B)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
// 1749. Maximum Absolute Sum of Any Subarray
#include "leetcode.h"

/*
 * you are given an integer array 'nums'. the absolute sum of a subarray '[nums,
 * nums[i + 1], ..., nums[r]]' is 'abs(nums, nums[i], ..., nums[r])'. return the
 * maximum absolute sum of any (possibly empty) subarray of 'nums'. note that
 * 'abs(x)' is defined as follows: if 'x' is negative integer, then 'abs(x) =
 * -x'. if 'x' is a non negative integer, then 'abs(x) = x'
 */

int maxAbsoluteSum(int *nums, int numsSize) {
  int total = 0, min = 0, max = 0;
  for (int i = 0; i < numsSize; i++) {
    total += nums[i];
    min = fmin(min, total);
    max = fmax(max, total);
  }
  return max - min;
}

int main() {
  int n1[] = {1, -3, 2, 3, -4}, n2[] = {2, -5, 1, -4, 3, -2};
  printf("%d\n", maxAbsoluteSum(n1, ARRAY_SIZE(n1))); // expect: 5
  printf("%d\n", maxAbsoluteSum(n2, ARRAY_SIZE(n2))); // expect: 8
}