152. Maximum Product Subarray LeetCode
来源:互联网 发布:台达dvp plc编程技巧 编辑:程序博客网 时间:2024/05/12 02:46
题意:给一个数组,求最大连续字段积。
题解:这个跟最大连续子段和是一个套路,不过这里需要维护最大连续字段和和最小连续子段和,因为他们之间是互相转换的。
class Solution {public: int maxProduct(vector<int>& nums) { int n = nums.size(); if(n == 0) return 0; int local_min = nums[0],local_max = nums[0]; int maxn = nums[0]; for(int i = 1; i < n; i++) { int tmp = local_max; local_max = max(nums[i],max(local_max * nums[i],local_min * nums[i])); local_min = min(nums[i],min(local_min * nums[i],tmp * nums[i])); maxn = max(maxn,local_max); } return maxn; }};
0 0
- LeetCode 152. Maximum Product Subarray
- [leetcode] 152.Maximum Product Subarray
- [LeetCode]152. Maximum Product Subarray
- leetcode:152. Maximum Product Subarray
- leetcode 152. Maximum Product Subarray
- 152. Maximum Product Subarray LeetCode
- [leetcode] 152. Maximum Product Subarray
- LeetCode *** 152. Maximum Product Subarray
- LeetCode 152. Maximum Product Subarray
- leetcode.152. Maximum Product Subarray
- LeetCode-152.Maximum Product Subarray
- LeetCode - 152. Maximum Product Subarray
- [Leetcode]152. Maximum Product Subarray
- LeetCode 152. Maximum Product Subarray
- leetcode:152. Maximum Product Subarray
- [leetcode]152. Maximum Product Subarray
- LeetCode 152. Maximum Product Subarray
- [LeetCode] 152. Maximum Product Subarray
- 2014蓝桥杯 小朋友排队
- 【Scala类型系统】自身类型(self type)引用
- VLC搭建RTSP服务器的过程 -测试通过
- struts2---struts.xml文件头
- 如何从我的 SD 卡中删除 Windows 10 IoT 核心版
- 152. Maximum Product Subarray LeetCode
- QT 的Moc Uic Rcc有什么用(360ui移植到eclipse)
- 设计模式C++学习笔记之八(Adapter适配器模式)
- asp.net 中错误页面的配置问题
- STL unordered_map(hash_map)详解
- 分布式系统和container
- Laravel 验证
- 小妞,我会给你幸福的
- Objective-C中的集合类