LeetCode 练习题解(152. Maximum Product Subarray)
来源:互联网 发布:淘宝联盟怎么做app 编辑:程序博客网 时间:2024/06/07 03:47
给一个数组,长度至少为1,要求找出连续长度子数组乘积的最大值
class Solution {public: int maxProduct(vector<int>& nums) { int tmpp=nums[0],tmpn=nums[0],ans=nums[0],tmp; int len=nums.size(); for(int i=1;i<len;i++){ tmp=tmpp; tmpp=max(max(nums[i],nums[i]*tmpp),nums[i]*tmpn); tmpn=min(min(nums[i],nums[i]*tmp),nums[i]*tmpn); ans=max(ans,tmpp); } return ans; }};
初始化当前位置0的最大乘积tmpp,最小乘积tmpn,最终答案ans,并且用tmp来保存上一步的tmpp
当前位置i的最大乘积有三种可能,nums[i],nums[i]*tmpp,nums[i]*tmpn
逐步更新,最终得到ans
0 0
- LeetCode 练习题解(152. Maximum Product Subarray)
- LeetCode题解:Maximum Product Subarray
- 152. Maximum Product Subarray 题解
- LeetCode 题解(57): 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
- 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
- 编译VTK时Qt5_DIR-NOTFOUND的解决方法
- Java中的自动装箱与拆箱
- Unity导出IOS的坑1
- 在Linux下的进程资源的限制(struct rlimit)详解
- 聚类算法——K-means, K-means++, KNN, GMM,
- LeetCode 练习题解(152. Maximum Product Subarray)
- 关于ajax跨域问题的一些认知
- delphi非常简单的线程安全队列
- css怎么写
- OpenGL(1)概述
- 正则表达式 总结
- 常见 Java 字节码 指令 助记符
- hdoj 5458 Stability 【并查集 + 树链剖分】
- 淘宝Tprofiler工具实现分析