Daily Archives: August 16, 2015


[leetcode] 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. Show Tags Show Similar Problems Attention: product means the result of multiplication, not the […]