LeetCode – Maximum Product Subarray (Java)

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. Java Solution – Dynamic Programming This is similar to maximum subarray. Instead of sum, the sign of number affect the product value. … Read more