首页 > 代码库 > Maximum Product Subarray
Maximum Product Subarray
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.
这道题A了很久也没A出来，看了http://blog.csdn.net/salutlu/article/details/39560795做出来了
思路DP
max只可能来自三种情况
1.max * A[i] // A[i] > 0
2.min * A[i] //A[i] < 0
3.A[i]
当然min也只可能来自这三种情况
1 public class Solution { 2 public int maxProduct(int[] A) { 3 if(A.length == 0) 4 return 0; 5 if(1 == A.length) 6 return A[0]; 7 int curMin = A[0]; 8 int curMax = A[0]; 9 int ret = A[0];10 11 for(int i = 1; i < A.length; i++){12 int temp = curMin * A[i];13 14 curMin = Math.min(A[i], Math.min(temp, curMax * A[i]));15 curMax = Math.max(A[i], Math.max(temp, curMax * A[i]));16 17 ret = ret > curMax ? ret:curMax;18 }19 return ret;20 }21 }
Maximum Product Subarray
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。