152-Maximum Product Subarray

【题目】

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest product = 6.

【analyze】

1.动态规划的算法，与Maximum Subarray类似

2.不过需要考虑两个负数相乘又会成为正数

3.设置局部最大值（正），局部最小值（负）和全局最大值

【算法】

public class Solution {public int maxProduct(int[] nums) {if(nums==null||nums.length==0)return 0;if(nums.length==1)return nums[0];int local_max=nums[0];int local_min=nums[0];int global=nums[0];for(int i=1;i<nums.length;i++) {int temp=local_max;local_max=Math.max(Math.max(nums[i]*local_max,nums[i]),nums[i]*local_min);   //local_max*nums[i],num[i]和num[i]*local_min的比较local_min=Math.min(Math.min(nums[i]*local_min,nums[i]),nums[i]*temp);global=Math.max(local_max,global);}return global;}
}

转载于:https://www.cnblogs.com/hwu2014/p/4480226.html

152-Maximum Product Subarray相关推荐

LeetCode 152. Maximum Product Subarray
152. Maximum Product Subarray Find the contiguous subarray within an array (containing at least one ...
【LeetCode】152. Maximum Product Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
leetcode 152. Maximum Product Subarray | 152. 乘积最大子数组（Java）
题目 https://leetcode.com/problems/maximum-product-subarray/ 题解 class Solution {public int maxProduct( ...
LeetCode 152. Maximum Product Subarray--动态规划--C++,Python解法
题目地址:Maximum Product Subarray - LeetCode Given an integer array nums, find the contiguous subarray w ...
【LeetCode】Maximum Product Subarray 求连续子数组使其乘积最大
Add Date 2014-09-23 Maximum Product Subarray Find the contiguous subarray within an array (containin ...
Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
LeetCode Maximum Product Subarray(最大子数组乘积)
Find the contiguous subarray within an array (containing at least one number) which has the large ...
子数组的最大乘积 Maximum Product Subarray
为什么80%的码农都做不了架构师?>>> 问题: Find the contiguous subarray within an array (containing at lea ...
LeetCode: Maximum Product Subarray
很久没练只能看别人代码了 1 class Solution { 2 public: 3 int maxProduct(int A[], int n) { 4 if (n == 0) return 0; ...
leetcode 152. Maximum Product Subarry
这道题求的是乘积的最大值的,那么依照之前的和的最大值类似的做法的,乘积的最大值可能是在最大值*当前值和最小值*当前值和当前值三者之间取得的最大值的,那么使用两个变量来保存每一步的最大最小值的. cla ...

152-Maximum Product Subarray

152-Maximum Product Subarray相关推荐

最新文章

热门文章