Create 41 maximum subarray.cpp

skjha1 · web-flow · commit d531d3c2315e · 2021-06-05T13:46:05.000+05:30
diff --git a/Array/Problems/41 maximum subarray.cpp b/Array/Problems/41 maximum subarray.cpp
@@ -0,0 +1,16 @@
+// kadane algo says that we will carry a sum until it gives the positive sum
+class Solution {
+public:
+    int maxSubArray(vector<int>& nums) {
+        int sum=0;
+        int maxi=INT_MIN;
+        for (auto i:nums)
+        {
+            sum+=i;
+            maxi=max(maxi,sum); // everytime take maximum after adding the next element 
+            if (sum<0) sum=0; // whenever sum become less then 0 set its value to zero 
+        }
+        return maxi;
+    }
+};
+// tc sc =O(n), O(1)
