[leetCode] Maximum Product Subarray
来源:互联网 发布:虚幻引擎for mac 编辑:程序博客网 时间:2024/05/16 09:34
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
.
参考了 @ych_ding 的方法,比我原来的简洁太多。
public class Solution { public int maxProduct(int[] A) { if (A.length == 0) return 0; if (A.length == 1) return A[0]; int min = A[0]; int max = A[0]; int res = max; for (int i = 1; i < A.length; i++) { int tmp1 = min * A[i]; int tmp2 = max * A[i]; min = Math.min(A[i], Math.min(tmp1, tmp2)); max = Math.max(A[i], Math.max(tmp1, tmp2)); res = Math.max(max, res); } return res; }}
0 0
- 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
- LeetCode-Maximum Product Subarray
- Python入门
- Python的模块、UI和事件
- [httpd]配置虚拟主机。
- linux rzsz安装
- 学生厌学的主要原因及消解措施
- [leetCode] Maximum Product Subarray
- ubuntu下安装 nvm ,node.js
- [leetcode 2] Add Two Numbers
- UML,为软件工程添砖加瓦
- NYoj-35-表达式求值-栈
- 虚拟机-问题-VMware Tools installation cannot be started manually while Easy Install is in progress.
- redis2.8.19安装
- Tomcat Maven Plugin使用
- 虚拟机-问题-Ubuntu安装VMware Tools