Maximum Product Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest product.html For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the largest
相關文章
相關標籤/搜索