Leetcode 152. 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
原创
2017-07-09 17:52:05 ·
177 阅读 ·
0 评论