class Solution {
public:
int maxProduct(vector& nums) {
vector dpmax(nums.size());
vector dpmin(nums.size());
dpmax[0] = nums[0];
dpmin[0] = nums[0];
int ans = nums[0];
for (int i = 1; i < nums.size(); ++i)
{
dpmax[i] = max(dpmax[i - 1] * nums[i], nums[i]);
dpmax[i] = max(dpmin[i - 1] * nums[i], dpmax[i]);
dpmin[i] = min(dpmin[i - 1] * nums[i], nums[i]);
dpmin[i] = min(dpmax[i - 1] * nums[i], dpmin[i]);
ans = max(ans, dpmax[i]);
}
return ans;
}
};