2014年10月22日
[LeetCode] Maximum Product Subarray
摘要： 找出最大产品量Find the contiguous subarray within an array (containing at least one number) which has the largest product.https://oj.leetcode.com/problems/ma... 阅读全文
posted @ 2014-10-22 12:05 EchoLee 阅读(108) 评论(0) 推荐(0) 编辑