Fork me on GitHub
2016年3月28日
【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, 阅读全文
posted @ 2016-03-28 14:57 __Neo 阅读(185) 评论(0) 推荐(0) 编辑