随笔分类 -  LeetCode

1014------算法笔记----------Maximum Product Subarray 最大乘积子数组
摘要：1.题目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]... 阅读全文
posted @ 2014-10-15 17:52 Monica_Lee 阅读(290) 评论(0) 推荐(0)