LeetCode Maximum Product Subarray_DP_最大子数组
题目:Maximum Product SubarrayFind 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 contig
原创
2017-01-07 16:07:17 ·
400 阅读 ·
0 评论