public int FindGreatestSumOfSubArray(int[] array) {
int sum = 0;
int maxSum = Integer.MIN_VALUE;
for(int i = 0; i < array.length; ++i){
sum += array[i];
if(sum > maxSum){
maxSum = sum;
}
if(sum < 0)
sum = 0;
}
return maxSum;
}
42 连续子数组的最大和
最新推荐文章于 2022-03-14 09:07:59 发布