2016年7月6日
LeetCode OJ 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],t 阅读全文
posted @ 2016-07-06 17:25 Black_Knight 阅读(164) 评论(0) 推荐(0) 编辑