152. Maximum Product Subarray (Array; DP)
摘要：
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],th 阅读全文
posted @ 2016-12-11 23:15 joannae 阅读(186) 评论(0) 推荐(0) 编辑
