class Solution {
public:
static const int N=20010;
int f[N],g[N];
int maxProduct(vector<int>& nums) {
int n=nums.size();
int res=nums[0];
f[0]=g[0]=nums[0];
for(int i=1;i<n;i++)
{
f[i]=max(nums[i],max(f[i-1]*nums[i],g[i-1]*nums[i]));
g[i]=min(nums[i],min(g[i-1]*nums[i],f[i-1]*nums[i]));
res=max(res,f[i]);
}
return res;
}
};
LeetCode 152. 乘积最大子数组
发布时间 2023-07-04 11:32:54作者: 穿过雾的阴霾