Maximum Product Subarray
来源:互联网 发布:thinking in java 4th 编辑:程序博客网 时间:2024/06/10 16:33
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.
题目是求乘积最大的连续子数组。与和最大的连续子数组很相似,不同的是这里
两个负负的数也可能得到最大的数,所以不仅要临时保存最大的乘积,也要保存
最小的乘积。
public int maxProduct(int[] nums) {if(nums==null||nums.length<=0)return 0;int max=nums[0],posMax=nums[0],negMax=nums[0];for(int i=1;i<nums.length;i++){int tmp=posMax;posMax=Math.max(Math.max(posMax*nums[i], nums[i]),negMax*nums[i]);negMax=Math.min(Math.min(tmp*nums[i], nums[i]), negMax*nums[i]);max=Math.max(posMax, max);}return max;}
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
- PAT 1022. Digital Library (30)
- jQuery_统计图插件-Prototype Javascript Framework
- Android(安卓)开发通过NDK调用JNI,使用opencv做本地c++代码开发配置方法实现边缘检测代码(2)
- 黑马程序员-----------------java基础-----------------多线程
- 程序员保值的五个关键点
- Maximum Product Subarray
- 工厂模式之抽象工厂模式
- UIAutomation使用测试入门
- 黑马程序员--java技术blog---第五篇:IO流(4)
- 代码流程分析二:Settings-蓝牙分析-搜索设备原理
- python下载视频
- GDB: don't know how to run
- [LeetCode] Populating Next Right Pointers in Each Node
- JS学习---(一)