【Leetcode】152. Maximum Product Subarray

题目地址：

https://leetcode.com/problems/maximum-product-subarray/

给定一个数组$A$，求其乘积最大的子数组。返回最大乘积。

思路是动态规划。设$m[i]$和$M[i]$分别是以$A[i]$结尾的最小和最大子数组乘积。那么有： m [ i ] = min ⁡ { A [ i ] , A [ i ] m [ i − 1 ] , A [ i ] M [ i − 1 ] } M [ i ] = max ⁡ { A [ i ] , A [ i ] m [ i − 1 ] , A [ i ] M [ i − 1 ] } m[i]=\min\{A[i],A[i]m[i-1],A[i]M[i-1]\}\\M[i]=\max\{A[i],A[i]m[i-1],A[i]M[i-1]\} m[i]=min{A[i],A[i]m[i−1],A[i]M[i−1]}M[i]=max{A[i],A[i]m[i−1],A[i]M[i−1]}最后返回${\max }_{i}M[i]$即可。也可以对$A[i]$的正负性进行讨论。代码如下：

class Solution {
 public:
  int maxProduct(vector<int>& a) {
    int n = a.size();
    int f[n], g[n], res;
    res = g[0] = f[0] = a[0];
    for (int i = 1; i < n; i++) {
      if (a[i] > 0) {
        f[i] = max(a[i], f[i - 1] * a[i]);
        g[i] = min(a[i], g[i - 1] * a[i]);
      } else {
        f[i] = max(a[i], g[i - 1] * a[i]);
        g[i] = min(a[i], f[i - 1] * a[i]);
      }

      res = max(res, f[i]);
    }

    return res;
  }
};

时空复杂度$O(l_A)$。