动态规划: 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
.
|
|
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
.
|
|