LeetCode 152. Maximum Product Subarray(最大乘积)
原题网址:https://leetcode.com/problems/maximum-product-subarray/
Find the contiguous subarray within an array (containing at least one number) which has the largest product.
For example, given the
原创
2016-05-26 01:04:48 ·
1017 阅读 ·
0 评论