zoukankan      html  css  js  c++  java
  • [LC] 152. Maximum Product Subarray

    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];
            int preMax = max;
            for (int i = 1; i < nums.length; i++) {
                // include the current for comparison
                max = Math.max(nums[i], Math.max(preMax * nums[i], min * nums[i]));
                min = Math.min(nums[i], Math.min(min * nums[i], preMax * nums[i]));
                res = Math.max(max, res);
                preMax = max;
            }
            return res;
        }
    }
  • 相关阅读:
    2014第5周一
    2014第4周日
    2014第4周六
    underscore.js
    2014第4周四
    2014第4周三
    2014年第2周二
    POj 3126 Prime Path
    Oracle EBS 入门
    HDU1698_Just a Hook(线段树/成段更新)
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12053862.html
Copyright © 2011-2022 走看看