2015年4月21日

LeetCode-152 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 @ 2015-04-21 21:55 linxiong1991 阅读(98) 评论(0) 推荐(0) 编辑

导航