The Blind 75 Leetcode Series: Maximum Product Subarray
Today, we are working on 152. Maximum Product Subarray
Given an integer array
nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product.
The test cases are generated so that the answer will fit in a 32-bit integer.
A subarray is a contiguous subsequence of the array.