#include<iostream>
using namespace std;
int FindMaxSum(int *num,int len) {
if (num == NULL||len<=0) return -1;
int max = 0, i = 1,sum = num[0];
while (i<len){
if (sum < num[i]&&sum<0) sum = 0;
sum += num[i];
if (num[i] < 0) max = sum - num[i];
if (max < sum) max = sum;
i++;
}
return max;
}
int main(){
int a[] = {1,-2,3,10,-4,7,2,-5};
int *num = a;
int t = FindMaxSum(a, 8);
cout << t;
return 0;
}
剑指offer42
最新推荐文章于 2022-08-19 10:22:11 发布