LeetCode(152) Maximum Product Subarray
来源：互联网 发布：国际域名和国别域名 编辑：程序博客网 时间：2024/05/21 10:36
一维动态规划
class Solution {public: int maxProduct(vector<int>& nums) { vector<int> minTmp(nums.size(), 0); vector<int> maxTmp(nums.size(), 0); vector<int> global(nums.size(), 0); minTmp[0] = nums[0]; maxTmp[0] = nums[0]; global[0] = nums[0]; for(int i = 1; i < nums.size(); i++) { minTmp[i] = min(min(nums[i], nums[i] * minTmp[i - 1]), nums[i] * maxTmp[i - 1]); maxTmp[i] = max(max(nums[i], nums[i] * minTmp[i - 1]), nums[i] * maxTmp[i - 1]); global[i] = max(global[i - 1], maxTmp[i]); } return global[nums.size() - 1]; } 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
- Maximum Product Subarray - LeetCode 152
- 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
- LeetCode之Symmetric Tree
- Kmeans中k值的相关理论
- java中有关MySQL常用的语句
- 持续交付|持续集成|持续部署
- Apriori算法
- LeetCode(152) Maximum Product Subarray
- QT中QTableWidget的使用
- 图书馆排序
- 不用库函数,用C语言实现将一整型数字转化为字符串
- C++复制构造函数和赋值符的区别
- 记我的WiFi音箱之一个网络在线播放及本地播放音乐器（五）
- apache局域网访问
- Red and Black
- Linux脚本的注意事项和命令之乐
