public class Solution {
public int maxProduct(int[] nums) {
int[] posMax = new int[nums.length];
int[] negMin = new int[nums.length];
posMax[0] = negMin[0] = nums[0];
int result = nums[0];
for (int i = 1; i < nums.length; i++) {
if (nums[i] > 0) {
posMax[i] = Math.max(nums[i], nums[i] * posMax[i - 1]);
negMin[i] = Math.min(nums[i], nums[i] * negMin[i - 1]);
} else if (nums[i] < 0) {
posMax[i] = Math.max(nums[i], nums[i] * negMin[i - 1]);
negMin[i] = Math.min(nums[i], nums[i] * posMax[i - 1]);
}
result = Math.max(result, posMax[i]);
}
return result;
}
}