Maximum Product Subarray

题目：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.

int maxProduct(int A[], int n) {if (A == nullptr || n <= 0)throw exception();if (n == 1)return A[0];int minnum = A[0], maxnum = A[0], res = A[0];for (int i = 1; i < n; i++){int t1 = minnum*A[i], t2 = maxnum*A[i];minnum = min(A[i], min(t1, t2));maxnum = max(A[i], max(t1, t2));res = max(res, maxnum);}return res;}