首页 > 代码库 > Maximum Product Subarray
Maximum Product Subarray
Dynamic Programming
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
.
C++实现代码:
#include<iostream>using namespace std;class Solution {public: int maxProduct(int A[], int n) { if(n==0) return 0; int maxPro[n]; int minPro[n]; minPro[0]=maxPro[0]=A[0]; int i; for(i=1;i<n;i++) { maxPro[i]=max(A[i],max(maxPro[i-1]*A[i],minPro[i-1]*A[i])); minPro[i]=min(A[i],min(maxPro[i-1]*A[i],minPro[i-1]*A[i])); } int max=maxPro[0]; for(i=0;i<n;i++) { if(max<maxPro[i]) max=maxPro[i]; } return max; }};int main(){ Solution s; int arr[10]={2,3,-2,4}; cout<<s.maxProduct(arr,4)<<endl;}
Maximum Product Subarray
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。