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.

 

依旧是DP算法，由于负数乘以负数也可以变成一个很大的数，因此要维护2个局部最优变量，局部最大和局部最小，代码如下：

public class Solution {        public int Min(int a,int b) {        return a
     
      b?a:b;    }        public int maxProduct(int[] A) {        int size = A.length;        int local_max = A[0];//局部最大        int local_min = A[0];//局部最小        int global = A[0];//全局最大        for(int i=1;i