Maximum Product Subarray

hard

Acceptance: 37%

Dynamic Programming

Given an integer array, identify the contiguous subarray whose product of elements is the largest and return that product.

Example 1:

Input:nums = [3,-1,4,-2]

Output:24

Explanation: The entire array has product 3*(-1)*4*(-2) = 24.

Example 2:

Input:nums = [-3,0,2,-5]

Output:2

Explanation: The single element [2] gives the maximum product.

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}