152. Maximum Product Subarray.java

152. Maximum Product Subarray
// https://leetcode.com/problems/maximum-product-subarray/

public int maxProduct(int A[], int n) {
    if (n == 0) return 0;
    int maxProduct = A[0], minProduct = A[0], maxRes = A[0];
    for (int i = 1; i < n; i++) {
        if (A[i] >= 0) {
            maxProduct = max(maxProduct * A[i], A[i]);
            minProduct = min(minProduct * A[i], A[i]);
        } else {
            int temp = maxProduct;
            maxProduct = max(minProduct * A[i], A[i]);
            minProduct = min(temp * A[i], A[i]);
        }
        maxRes = max(maxRes, maxProduct);
    }
    return maxRes;
}