首页 > 代码库 > 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.
1 public class Solution { 2 public int maxProduct(int[] A) { 3 if(A == null || A.length == 0) return 0; 4 int result = A[0]; 5 int max = A[0]; 6 int min = A[0]; 7 for(int i = 1; i < A.length; i ++){ 8 int first = A[i] * max; 9 int second= A[i] * min;10 max = Math.max(Math.max(first, second), A[i]);11 min = Math.min(Math.min(first, second), A[i]);12 result = Math.max(result, max);13 }14 return result;15 }16 }
Maximum Product Subarray
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。