152. Maximum Product Subarray
来源:互联网 发布:java中逻辑或 编辑:程序博客网 时间:2024/06/11 18: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.
Subscribe to see which companies asked this question.
class Solution {public: int maxProduct(vector<int>& nums) { int len = nums.size(); if(len == 0) return 0; int *MaxF = new int[len]; int *MinF = new int[len]; int s = nums[0]; MaxF[0] = nums[0]; MinF[0] = nums[0]; for(int i = 1; i < len; ++i){ int t1 = MaxF[i - 1] * nums[i]; int t2 = MinF[i - 1] * nums[i]; MaxF[i] = max(max(t2, t1), nums[i]); MinF[i] = min(min(t2, t1), nums[i]); if(MaxF[i] > s) s = MaxF[i]; } return s; }};
阅读全文
0 0
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- 152. Maximum Product Subarray
- I2C的传输速率由什么决定
- Redis LRU
- 设计模式(2)
- BZOJ2521: [Shoi2010]最小生成树
- 最小公倍数
- 152. Maximum Product Subarray
- liunx的awk命令
- Java Web中前台与后台传递参数小结
- BeaEngine反汇编引擎在C中的使用
- script三种加载方式
- 常用git 命令
- LeetCode 100. Same Tree(二叉树)
- 巴士博弈 【总结】
- Unity实现Angry Bird弹弓发射功能