Maximum Product Subarray

liujunlovecs

于 2015-08-01 13:50:14 发布

阅读量210

点赞数

本文链接：https://blog.csdn.net/liujunlovecs/article/details/47185793

版权

刷题同时被 3 个专栏收录

199 篇文章 0 订阅

订阅专栏

Leetcode

198 篇文章 0 订阅

订阅专栏

Array

40 篇文章 0 订阅

订阅专栏

DP + 滚动矩阵

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