> For the complete documentation index, see [llms.txt](https://anand-aryan.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anand-aryan.gitbook.io/leetcode/152.-maximum-product-subarray.md).

# 152. Maximum Product Subarray

Maximum Product Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array \[2,3,-2,4], the contiguous subarray \[2,3] has the largest product = 6.

## Solution <a href="#solution" id="solution"></a>

```java
public 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 preMax = max;

            max = Math.max(Math.max(min*nums[i], max*nums[i]), nums[i]);
            min = Math.min(Math.min(min*nums[i], preMax*nums[i]), nums[i]);

            res = Math.max(max, res);
        }

        return res;
    }
}
```