public class Solution {
public int FindGreatestSumOfSubArray(int[] array) {
if(array == null || array.length == 0){
return 0;
}
int result = array[0];//最大和
int curSum = 0;//当前和
for(int i = 0;i < array.length;i++){
if(curSum < 0){//和为负,舍弃
curSum = array[i];
}else{
curSum += array[i];
}
if(curSum > result){
result = curSum;
}
}
return result;
}
}
剑指offer(30)连续子数组的最大和
猜你喜欢
转载自blog.csdn.net/qq_34403001/article/details/88974576
今日推荐
周排行