Maximum Product Subarray
来源:互联网 发布:剑灵数据库 编辑:程序博客网 时间:2024/05/04 14:36
public class Solution { public int maxProduct(int[] A) { int n=A.length; if(n==0) return 0; if(n==1) return A[0]; int curMin=A[0]; int curMax=A[0]; int ans=A[0]; for(int i=1;i<n;i++) { int temp=A[i]*curMin; curMin=Math.min(A[i],Math.min(temp,A[i]*curMax)); curMax=Math.max(A[i],Math.max(temp,A[i]*curMax)); ans=Math.max(ans,curMax); } return ans; }}
0 0
- LeetCode_Maximum Subarray | Maximum Product Subarray
- Maximum Product Subarray
- Maximum Product Subarray
- 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
- Maximum Product Subarray
- Maximum Product Subarray
- [LeetCode]Maximum Product Subarray
- Leetcode Maximum Product Subarray
- @Transient
- 数据结构2学习笔记
- 短弱引用和长弱引用
- 制作Andriod程序的数字签名
- javabean的内省操作
- Maximum Product Subarray
- sublime text 2安装及使用
- hdu 1302 The Snail
- 基于BOOST::ASIO封装的异步套接字
- 数组 sizeof不同情况
- 继承与派生
- Shortest unique prefix
- 第10周项目3血型统计
- python魔法方法:__getattr__,__setattr__,__getattribute__