算法的介绍可以看下面的连接:
https://en.wikipedia.org/wiki/Maximum_subarray_problem
下面是一个 C的实现
#include <limits.h>
int find_maximum_subarray(int *array, int size)
{
int start = 0, end = 0;
int sum = INT_MIN;
int tmp_sum = 0;
int j = 0;
int i;
for(i = 0; i < size; i++)
{
tmp_sum += array[i];
if(tmp_sum > sum)
{
sum = tmp_sum;
start = j;
end = i;
}
if( tmp_sum < 0)
{
tmp_sum = 0;
j = i + 1;
}
}
return sum;
}
int main(int argc, char **argv)
{
//int data[] = {-2, 1, -3, 4, -1, 2, 1, -5, 4};
int data[] = {-2, -1, -3, -4, -1, -2, -1, -5, -4};
int ret = find_maximum_subarray(data, sizeof(data)/sizeof(data[0]));
return 0;
}