151_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.

1:特殊情况， n为0或者1的时候；2:动态规划方法，全局最大值和局部最大值最小值；3:遍历数组，当遍历到第i个数值的时候，获得以第i个数值结尾的局部最大值和局部最小值；因为是连续数字相乘，所以局部最小乘以一个数字可能是局部最大值；4:局部最大值与全局最大值相比较，更新全局最大值。

int maxProduct(int A[], int n)
    {
        
        if(n == 0)
        {
            return 0;
        }
        
        if(n == 1)
        {
            return A[0];
        }
        
        int result = A[0];
        int curMax = A[0];
        int curMin = A[0];
        
        for(int i = 1; i < n; i++)
        {
            int temp = curMax * A[i];
            curMax = max(temp, max(A[i], curMin * A[i]));
            curMin = min(temp, min(A[i], curMin * A[i]));
            
            result = max(curMax, result);
        }
    
        return result;
    }