Leetcode-problems/problem1749.java at main · tejatayi/Leetcode-problems · GitHub

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
27
28
29
30
31
32
33
34
35
36
37
38
//1749. Maximum Absolute Sum of Any Subarray


public class problem1749 {

    public static int maxAbsoluteSum(int[] nums) {


        int max =0;
        int min = 0 , sum =0;

        for(int i=0;i<nums.length;i++)
        {
         sum+=nums[i];
         max=Math.max(max, sum);
         min=Math.min(min, sum);
        }


      return Math.abs(max-min);


    }


    public static void main(String[] args) {

        int [] a = {-3,-5,-3,-2,-6,3,10,-10,-8,-3,0,10,3,-5,8,7,-9,-9,5,-8};

        System.out.println(maxAbsoluteSum(a));

    }

}