码迷,mamicode.com
首页 > 其他好文 > 详细

Maximum Subarray

时间:2016-06-29 19:07:16      阅读:157      评论:0      收藏:0      [点我收藏+]

标签:

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,1,−5,4],
the contiguous subarray [4,−1,2,1] has the largest sum = 6.

Maximum Subarray

标签:

原文地址:http://www.cnblogs.com/sherylwang/p/5627826.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!