@@ -0,0 +1,737 @@
+// Find the contiguous subarray within an array (containing at least one number) which has the largest product.%0A%0A// For example, given the array %5B2,3,-2,4%5D,%0A// the contiguous subarray %5B2,3%5D has the largest product = 6.%0A%0Apublic class Solution %7B%0A    public int maxProduct(int%5B%5D A) %7B%0A        int len = A.length;%0A        if(len == 0)%7B%0A            return 0;%0A        %7D%0A%0A        int max = A%5B0%5D;%0A        int min = A%5B0%5D;%0A        int res = A%5B0%5D;%0A%0A        for (int i = 1; i %3C len; i++)%7B%0A            int a = max * A%5Bi%5D;%0A            int b = min * A%5Bi%5D;%0A            int c = A%5Bi%5D;%0A            max = Math.max(a, Math.max(b, c));%0A            min = Math.min(a, Math.min(b, c));%0A            res = max %3E res? max : res;%0A        %7D%0A        return res;%0A    %7D%0A%7D

add maximum product subarray solution