Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.
(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.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results