2014年10月15日
[leetCode][001] 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,-... 阅读全文
posted @ 2014-10-15 10:22 菜鸟加贝的爬升 阅读(205) 评论(0) 推荐(0) 编辑