2014年10月8日
Leetcode 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... 阅读全文
posted @ 2014-10-08 16:44 OpenSoucre 阅读(178) 评论(0) 推荐(0) 编辑