[Leetcode] Maximum Product Subarra
来源:互联网 发布:适合开发的linux系统 编辑:程序博客网 时间:2024/06/05 09:36
Algorithm: Dynamic Programming
Time Complexity: O(n)
Space Complexity: O(1)
class Solution {public: inline int getMax(int num1, int num2) { return num1 > num2 ? num1 : num2; } inline int getMin(int num1, int num2) { return num1 > num2 ? num2 : num1; } int maxProduct(vector<int>& nums) { int size = nums.size(); if (size <= 0) return 0; int max = nums[0]; int prevMax = nums[0]; int prevMin = nums[0]; for (int i = 1; i < size; ++i) { int tmp1 = getMax(nums[i] * prevMax, nums[i] * prevMin); int tmp2 = getMin(nums[i] * prevMax, nums[i] * prevMin); prevMin = getMin(nums[i], tmp2); prevMax = getMax(nums[i], tmp1); max = getMax(max, prevMax); } return max; }};
0 0
- [Leetcode] Maximum Product Subarra
- 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
- STL之pair类型详细分析
- I++,I--,++I,--I
- socket中的发送与接收函数
- iOS开发之自定义圆环式Slider
- 你如安好,便是晴天
- [Leetcode] Maximum Product Subarra
- FW300R路由器自动断线换IP
- 【无限互联】上下拉刷新瀑布流
- socket的基本函数
- IOS8地图的启动问题
- poj 3009 Curling 2.0 (dfs )
- HDOJ 2665 Kth number
- 计算云时代
- 如何调试makefile