https://leetcode.com/problems/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
.
posmax[i] = Math.max(Math.max(A[i], posmax[i-1]*A[i]), negmax[i-1]*A[i]);
negmax[i] = Math.min(Math.min(A[i], posmax[i-1]*A[i]), negmax[i-1]*A[i]);
其中posmax是当前位置最大值,negmax是当前位置最小值。
另外保存一个全局最大乘值max作为返回结果,代码如下:
public class Solution {
public int maxProduct(int[] A) {
int max = A[0];
int[] posmax = new int[A.length];
posmax[0] = A[0];
int[] negmax = new int[A.length];
negmax[0] = A[0];
for(int i=1; i<A.length; i++){
posmax[i] = Math.max(Math.max(A[i], posmax[i-1]*A[i]), negmax[i-1]*A[i]);
if(posmax[i] > max) max = posmax[i];
negmax[i] = Math.min(Math.min(A[i], posmax[i-1]*A[i]), negmax[i-1]*A[i]);
}
return max;
}
}
时间复杂度O(n),空间复杂度O(2n)