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