2016年3月24日
摘要: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2, 阅读全文
posted @ 2016-03-24 16:23 狂奔的蜗牛163 阅读(314) 评论(0) 推荐(0) 编辑
摘要: 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-03-24 15:42 狂奔的蜗牛163 阅读(271) 评论(0) 推荐(0) 编辑