Time: 7 ms (57.25%), Space: 13.8 MB (63.54%) - LeetHub

Dipendra-Raghav · Aug 23, 2023 · c6a87b0 · c6a87b0
1 parent a5d6684
commit c6a87b0
Showing 1 changed file with 19 additions and 0 deletions.
diff --git a/0152-maximum-product-subarray/0152-maximum-product-subarray.cpp b/0152-maximum-product-subarray/0152-maximum-product-subarray.cpp
@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int maxProduct(vector<int>& nums) {
+        int pre=1;
+        int pos=1;
+        int ans=INT_MIN;
+
+        for(int i=0;i<nums.size();i++)
+        {
+            if(pre==0)pre=1;
+            if(pos==0)pos=1;
+            pre=pre*nums[i];
+            pos=pos*nums[nums.size()-i-1];
+            ans=max(ans,max(pre,pos));
+        }
+        return ans;
+
+    }
+};