Time: 235 ms (5.04%), Space: 67.8 MB (5.95%) - LeetHub

champ96k · champ96k · commit 9c41ec35aaa7 · 2021-10-21T18:03:41.000+05:30
diff --git a/maximum-subarray/maximum-subarray.cpp b/maximum-subarray/maximum-subarray.cpp
@@ -0,0 +1,17 @@
+class Solution {
+public:
+    int maxSubArray(vector<int>& nums) {
+        
+        int maxSum = INT_MIN, currentSum = 0;;
+        for(int i=0;i<nums.size();i++) {
+            currentSum = currentSum + nums[i];  
+            if(maxSum<currentSum) {
+                maxSum = currentSum;
+            } if(currentSum<0) {
+                currentSum = 0;
+            }
+        }
+        
+        return maxSum;
+    }
+};
