首页 > 代码库 > LeetCode——Maximum Product Subarray
LeetCode——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
.
求数组中的最大连续乘积。
public int maxProduct(int[] A) { if (A == null || A.length == 0) return 0; int max = A[0], min = A[0], result = A[0]; for (int i = 1; i < A.length; i++) { int inner_max = max; max = Math.max(Math.max(max * A[i], A[i]), min * A[i]); min = Math.min(Math.min(inner_max * A[i], A[i]), min * A[i]); result = Math.max(max, result); } return result; }
LeetCode——Maximum Product Subarray
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。