public class Solution {
public int maxProduct(int[] nums) {
if(nums.length==0) return 0;
int min=nums[0],max=nums[0],res=nums[0];
for(int i=1;i<nums.length;i++){
int temp=min;
min=Math.min(Math.min(nums[i],min*nums[i]),nums[i]*max);
max=Math.max(Math.max(nums[i],max*nums[i]),nums[i]*temp);
if(res<max) res=max;
}
return res;
}
}
152. Maximum Product Subarray
LeetCode 152. Maximum Product Subarray Description Given ...
152. Maximum Product Subarray Given an integer array nums...
练手题：152. Maximum Product Subarray156. Binary Tree Upside ...
题目分析 Find the contiguous subarray within an array (contai...
问题描述 Given an integer array nums, find the contiguous sub...
动态规划的做法，转移方程真的很难写我至今还是糊糊涂涂的
Find the contiguous subarray within an array (containing ...
Find the contiguous subarray within an array (containing ...
为了求最后的乘积最大，我们先看看最后的结果是通过怎样的比较产生的。举个例子nums[3] => nums[0],n...
本文标题：152. Maximum Product Subarray
本文链接：https://www.haomeiwen.com/subject/zghbpttx.html
网友评论