题目
代码
public class Solution {
public int maxProduct(int[] A) {
if (A == null || A.length == 0) return 0;
int[] dp_max = new int[A.length];
int[] dp_min = new int[A.length];
dp_max[0] = A[0];
dp_min[0] = A[0];
int res = A[0];
for (int i = 1; i < A.length; i++) {
dp_max[i] = Math.max( Math.max(dp_max[i - 1] * A[i], dp_min[i - 1] * A[i]) , A[i]);
dp_min[i] = Math.min( Math.min(dp_max[i - 1] * A[i], dp_min[i - 1] * A[i]) , A[i]);
res = Math.max(res, dp_max[i]);
}return res;
}
}