LeetCode: Maximum Product Subarray
来源:互联网 发布:淘宝联盟网站推广位 编辑:程序博客网 时间:2024/05/19 15:24
只贴个solution,很容易看懂。简而言之,由于是乘法,除了维护最大值,0和负数的存在需要我们维护最小值和当前值。
int maxProduct(int A[], int n) { if (n == 1){ return A[0]; } int maxV = A[0]; int minV = A[0]; int result = A[0]; for (int i = 1; i < n; i++){ int tmp = maxV; maxV = max(max(maxV*A[i], minV*A[i]), A[i]); minV = min(min(tmp*A[i], minV*A[i]),A[i]); result = max(result, maxV); } return result; }
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
- cocos2d-x Helloworld 详解
- java学习——包装类
- java 阿里面试常见30道题目汇总
- 关于今天谈项目的事
- Parsing Strings with split
- LeetCode: Maximum Product Subarray
- 符号之来龙去脉
- ZOJ 3822 Domination 概率DP
- Girl_iOS100天学iOS的第十一天(流水日记一篇)
- asp.net C#母版页和内容页事件排版加载顺序生命周期
- poj 1759 Garland 二分搜索
- Verilog状态机详谈
- ASP.NET动态网站开发培训-39.互动论坛制作(七、制作回复留言页面)
- leetcode Permutations II