Leetcode 152. Maximum Product Subarray (Medium) (cpp)

/*

152. Maximum Product Subarray (Medium)

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.

*/
class Solution {
public:
int maxProduct(vector<int>& nums) {
if(nums.empty()) return 0;
int cur_max = nums[0], cur_min = nums[0], maxProduct = nums[0];
for(int i = 1; i < nums.size(); i++) {
int prev_min = cur_min, prev_max = cur_max;
cur_max = max(nums[i], max(prev_max * nums[i], prev_min * nums[i]));
cur_min = min(nums[i], min(prev_max * nums[i], prev_min * nums[i]));
maxProduct = max(cur_max, maxProduct);
}
return maxProduct;
}
};