Time: 66 ms (87.53%), Space: 40 MB (38.25%) - LeetHub

Dipendra-Raghav · Jan 18, 2023 · 0bcf885 · 0bcf885
1 parent 8b93b04
commit 0bcf885
Showing 1 changed file with 14 additions and 0 deletions.
diff --git a/0918-maximum-sum-circular-subarray/0918-maximum-sum-circular-subarray.cpp b/0918-maximum-sum-circular-subarray/0918-maximum-sum-circular-subarray.cpp
@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int maxSubarraySumCircular(vector<int>& nums) {
+        int totalSum = 0, maxSum = INT_MIN, curMax = 0, minSum = INT_MAX, curMin = 0;
+    for (int x : nums) {
+        curMax = max(x, curMax + x);  
+        maxSum = max(maxSum, curMax); 
+        curMin = min(x, curMin + x);  
+        minSum = min(minSum, curMin); 
+        totalSum += x;
+    }
+    return maxSum > 0 ? max(maxSum, totalSum - minSum) : maxSum;
+    }
+};