Time: 0 ms (100%), Space: 45.2 MB (20.65%) - LeetHub

karygauss03 · karygauss03 · commit 9e6229300e38 · 2025-02-26T09:15:20.000+01:00
diff --git a/1849-maximum-absolute-sum-of-any-subarray/1849-maximum-absolute-sum-of-any-subarray.cpp b/1849-maximum-absolute-sum-of-any-subarray/1849-maximum-absolute-sum-of-any-subarray.cpp
@@ -0,0 +1,27 @@
+class Solution {
+public:
+    int maxAbsoluteSum(vector<int>& nums) {
+        int n = nums.size();
+        int mx = INT_MIN, mn = INT_MAX, cur_mx = 0, cur_mn = 0;
+        for (int i = 0 ; i < n ; i++){
+            cur_mx += nums[i];
+            if (cur_mx > mx){
+                mx = cur_mx;
+            }
+            if (cur_mx < 0){
+                cur_mx = 0;
+            }
+        }
+        
+        for (int i = 0 ; i < n ; i++){
+            cur_mn += nums[i];
+            if (cur_mn < mn){
+                mn = cur_mn;
+            }
+            if (cur_mn > 0){
+                cur_mn = 0;
+            }
+        }
+        return max(abs(mx), abs(mn));
+    }
+};
