[LeetCode] 152. 乘积最大子数组 ☆☆☆(动态规划)

if (null == nums || nums.length <= 0) {
            return Integer.MIN_VALUE;
        }
        int res = nums[0];
        int max = nums[0];
        int min = nums[0];
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] < 0) {//当前元素为负数，交换最大最小值
                int temp = max;
                max = min;
                min = temp;
            }
            max = Math.max(nums[i] * max, nums[i]);
            min = Math.min(nums[i] * min, nums[i]);
            res = Math.max(max, res);
        }
        return res;