Find the contiguous subarray within an array (containing at least one number) which has the largest product.
For example, given the array
the contiguous subarray
Java Code:
[2,3,-2,4]
,the contiguous subarray
[2,3]
has the largest product = 6
.
No comments:
Post a Comment