leetcode_Maximum Product Subarray
来源:互联网 发布:windows开机不显示壁纸 编辑:程序博客网 时间:2024/06/05 11:39
这个是最大子序列乘积问题,之前有看过最大子序列和,那个比较简单,在我前面也有写过:
最大子序列和传送门:http://blog.csdn.net/alps1992/article/details/38072329
这个乘积其实和那个比较像,但是有个问题,就是可能出现负数相乘为正成为最大的数,所以需要维护的变量是两个,而不是一个了~
代码如下:
class Solution{public: int maxProduct(int A[], int n){ int max = A[0]; int min = A[0]; int maxProductNum = A[0]; int maxNum = A[0],minNum = A[0]; int i = 1; for (i = 1; i < n; i++) { max = Max(Max(maxNum*A[i], minNum*A[i]), A[i]); min = Min(Min(maxNum*A[i], minNum*A[i]), A[i]); maxProductNum = Max(max, maxProductNum); maxNum = max; minNum = min; } return maxProductNum; } int Max(int a, int b){ return a>b?a:b; } int Min(int a, int b){ return a<b?a:b; }};
0 0
- leetcode_Maximum Product Subarray
- leetcode_Maximum Product Subarray
- leetcode_Maximum Product Subarray
- leetCode_Maximum Product Subarray
- LeetCode_Maximum Subarray | Maximum Product Subarray
- Leetcode_Maximum Product Subarray(c++ version)
- Leetcode_maximum-subarray
- Leetcode_Maximum Subarray
- leetcode_Maximum Product Subarray _medium(最大子数组之积)
- leetcode_Maximum Subarray _medium(最大子数组的和)
- 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
- android【资源汇总分享】Android开发资源汇总之一
- CSS 实现加载动画之七-彩环旋转
- Oracle中通过Function,存储过程,触发器,调用实现解析Clob字段中存在的xml字符串
- rz传文件老是不对的问题
- MySQL InnoDB性能调整的一点实践
- leetcode_Maximum Product Subarray
- php获取网页内容方法总结
- phpmyadmin 免登陆
- tcp socket的发送与接收缓冲区
- RTCP包中的NTP Time 计算
- java中arrayList和vector区别
- Android:取R.string.Text值却得到一串数字的解决方案
- Qt 内存管理机制
- 【java】java BIO