Leetcode Maximum Product Subarray
来源:互联网 发布:成都市网络理政平台app 编辑:程序博客网 时间:2024/05/21 07:02
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 A[0];
int pMax=A[0],nMax=A[0],m=A[0];
for(int i = 1; i < n; i++)
{
if(A[i]<0) swap(pMax,nMax);
pMax=max(pMax*A[i],A[i]);
nMax=min(nMax*A[i],A[i]);
m = max(pMax,m);
}
return m;
}
};
0 0
- Maximum Product Subarray 【LeetCode】
- [LeetCode] Maximum Product Subarray
- leetcode-Maximum Product Subarray
- Maximum Product Subarray -- LeetCode
- LeetCode-Maximum Product Subarray
- [LeetCode]Maximum Product Subarray
- [LeetCode]Maximum Product Subarray
- 【LeetCode】Maximum Product Subarray
- leetcode:Maximum Product Subarray
- leetcode: Maximum Product Subarray
- Leetcode: Maximum Product Subarray
- [LeetCode]Maximum Product Subarray
- Leetcode Maximum Product Subarray
- [Leetcode]Maximum Product Subarray
- Leetcode--Maximum Product Subarray
- Maximum Product Subarray [leetcode]
- LeetCode | Maximum Product Subarray
- LeetCode-Maximum Product Subarray
- mtk 驱动笔记 lcd camera led tp
- Boost Lockfree
- Python关键字yield详解
- hashCode与equals详解
- (十) 进程和信号
- Leetcode Maximum Product Subarray
- HTML5的history API,保存ajax数据
- html中关于li横向显示的css写法
- Struts1防止页面重复提交解决方案
- Spring整合Jms学习(四)_事务管理
- 在敏捷环境中用wiki高效地组织测试用例
- 栈(stack)C语言链表实现&&数组实现
- 奇迹Mu分析 - NPC相关操作
- 编写高性能JavaScript