数组{-5,3,-4,2,5,1,2,3,-7,6},子数组的最大和{2,5,1,2,3}
在这里,主要分为2种情况:
1、数组中没有环
int array_maxSum(vector<int>& array)
{
int max_sum = INT_MIN, sum = 0;
for(int i = 0; i < array.size(); i++)
{
sum = max(sum + array[i], array[i]);
max_sum = max(max_sum, sum);
}
return max_sum;
}
2、数组中存在环
参考链接:
https://www.cnblogs.com/TenosDoIt/p/3698246.html
https://blog.csdn.net/wangzhiyu1980/article/details/51392500