[LeetCode] Maximum Product Subarray

题目描述：

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest product = 6.

解题方案：

转载地址：http://blog.csdn.net/sbitswc/article/details/39546719

最大值的产生：

1. if A[i] > 0, MaxValue = A[i] * MaxValue
2. if A[i] < 0, MinValue = A[i] * MinValue
3. A[i]

下面是该题代码：

class Solution {
public:
    int maxProduct(int A[], int n) {
        if (n == 0) {return 0;}
        if (n == 1) {return A[0];}

        int result = A[0];
        int CurMin = A[0];
        int CurMax = A[0];

        for (int i = 1; i < n; ++i) {
            int temp = CurMin * A[i];
            CurMin = min(A[i], min(temp, CurMax * A[i]));
            CurMax = max(A[i], max(temp, CurMax * A[i]));
            result = max(result, CurMax);
        }

        return result;
    }
};