LeetCode - 152 - 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.

求乘积最大的子序列。

时间复杂度O(n)，空间复杂度O(1)

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        int ans = nums[0];
        for (int i = 1, mmax = ans, mmin = ans; i < nums.size(); ++i) {
            if (nums[i] < 0)
                swap(mmax, mmin);
            mmax = max(nums[i], mmax * nums[i]);
            mmin = min(nums[i], mmin * nums[i]);
            ans = max(ans, mmax);
        }
        return ans;
    }
};