Problem:
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.
Java Code:
public class Solution {
public int maxProduct(int[] A) {
if (A == null || A.length == 0) {
return 0;
} else if (A.length == 1) {
return A[0];
}
int length = A.length;
int [] sMax = new int[length];
int [] sMin = new int[length];
int maxProduct = A[0];
sMax[0] = A[0];
sMin[0] = A[0];
for (int i = 1; i < length; i++) {
sMax[i] = Math.max(Math.max(sMax[i - 1] * A[i], sMin[i - 1] * A[i]), A[i]);
sMin[i] = Math.min(Math.min(sMax[i - 1] * A[i], sMin[i - 1] * A[i]), A[i]);
maxProduct = Math.max(maxProduct, sMax[i]);
}
return maxProduct;
}
}
没有评论:
发表评论