152. Maximum Product Subarray

最新推荐文章于 2020-10-02 09:22:09 发布

狼王神起

最新推荐文章于 2020-10-02 09:22:09 发布

阅读量149

点赞数

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/qq_36262896/article/details/81253922

版权

leetcode 专栏收录该内容

8 篇文章

订阅专栏

Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.

Example 1:

Input: [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.

Example 2:

Input: [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.

class Solution {
    public int maxProduct(int[] nums) {
        if(nums == null||nums.length == 0){
            return 0;
        }
        int max = nums[0];
        int min = nums[0];
        int res = nums[0];
        for(int i = 1;i<nums.length;i++){
            int a = nums[i]*min;
            int b = nums[i]*max;
            max = Math.max(Math.max(a,b),nums[i]);
            min = Math.min(Math.min(a,b),nums[i]);
            if(max>res){
                res = max;
            }
        }
        return res;
    }
}