Leetcode 152 Maximum Product Subarray Solution in c++ | Hindi Coding Community

 

 Given an integer array nums, find a subarray that has the largest product, and return the product.

The test cases are generated so that the answer will fit in a 32-bit integer.

Example 1:

Input: nums = [2,3,-2,4]

Output: 6

Explanation: [2,3] has the largest product 6.

    int maxProduct(vector<int> A) {

        int n = A.size(), res = A[0], l = 0, r = 0;

        for (int i = 0; i < n; i++) {

            l =  (l ? l : 1) * A[i];

            r =  (r ? r : 1) * A[n - 1 - i];

            res = max(res, max(l, r));

        }

        return res;

    }