[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.

动态规划

public class Solution {
    public int maxProduct(int[] A) {
        assert A.length>0;
        int max = A[0],min = A[0],res = A[0];
        for(int i= 1;i