DP-LeetCode-152. 乘积最大子数组

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        int f = nums[0];
        int g = nums[0];
        int ans = nums[0];
        int n = nums.size();
        for (int i = 1; i < n; i++) {
            int a = nums[i];
            int nf = f * a;
            int ng = g * a;
            f = max(a, max(nf, ng));
            g = min(a, min(nf, ng));
            ans = max(ans, f);
        }
        return ans;
    }
};