152. Maximum Product Subarray
来源:互联网 发布:人员去向软件 编辑:程序博客网 时间:2024/06/07 02:32
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
.
1、maxDP = max(maxDP*nums[n+1], nums[i+1], minDP*nums[n+1]);
2、minDP = min(maxDP*nums[n+1], nums[i+1], minDP*nums[n+1]);
3、max = max(max, maxDP);
从0开始,代码如下:
public class Solution { public int maxProduct(int[] nums) { if (nums.length == 0 || nums == null) { return 0; } int minDP = nums[0], maxDP = nums[0], max = nums[0]; for (int i = 1; i < nums.length; i ++) { int premaxDP = maxDP; maxDP = Math.max(Math.max(maxDP * nums[i], nums[i]), minDP * nums[i]); minDP = Math.min(Math.min(premaxDP * nums[i], nums[i]), minDP * nums[i]); max = Math.max(max, maxDP); } return max; }}
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
- oracle修改用户名
- WERTYU(常量数组的妙用)(UVa10082)
- Java常用算法——搜索(dfs) & 回溯(全排列、八皇后、分苹果问题的详细解析)
- C++ 程序员快过来围观:非常实用全面的 C++ 资源
- 网易云音乐锁屏界面实现
- 152. Maximum Product Subarray
- react 根据props改变来执行一些操作
- 开博客啦
- Ubuntu WPS字体缺失配置
- 函数指针的调用
- Android学习笔记(二)Activiy学习——界面传值
- jdk8的datetime时间函数使用示例
- #636 – 持续按住按键会多次触发键盘事件(Keyboard Events that Fire When A Key Is Held Down)
- Linux 编程之 VIM 详细配置