20230426 顺利通过
题目
约束
题解
class Solution {
public:
int maxProduct(vector<int>& nums) {
int maxF = nums[0], minF = nums[0], ans = nums[0];
for (int i = 1; i < nums.size(); ++i) {
int mx = maxF, mn = minF;
maxF = max(mx * nums[i], max(nums[i], mn * nums[i]));
minF = min(mn * nums[i], min(nums[i], mx * nums[i]));
ans = max(maxF, ans);
}
return ans;
}
};
标签:152,乘积,nums,int,max,minF,ans,maxF,LeetCode
From: https://www.cnblogs.com/chuixulvcao/p/17353455.html