首页 > 代码库 > 【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.
类似于求连续子序列最大和，但是乘法还涉及到符号的问题，比较方便的方法是同时维护到当前元素的最大乘积和最小乘积。
1 class Solution { 2 public: 3 int maxProduct(int A[], int n) { 4 5 int max_ending_here = A[0]; 6 int min_ending_here = A[0]; 7 8 int max_so_far = A[0]; 9 10 for (int i = 1; i < n; ++i) {11 int p_max = A[i] * max_ending_here;12 int p_min = A[i] * min_ending_here;13 14 max_ending_here = max(A[i], max(p_max, p_min));15 min_ending_here = min(A[i], min(p_max, p_min));16 17 max_so_far = max(max_so_far, max_ending_here);18 }19 20 return max_so_far;21 }22 };
【Leetcode】Maximum Product Subarray
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。