求最大连续子数组之和
代码实现
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] array = {1,-2,4,8,-4,7,-1,-5};
System.out.println("最大连续子数组之和:"+maxCountArray(array));
}
private static int maxCountArray(int[] array) {
// TODO Auto-generated method stub
int maxSum = Integer.MIN_VALUE;
for(int i=0;i<array.length;i++) {
int sum = 0;
for(int j=i;j<array.length;j++) {
sum += array[j];
if(sum>maxSum) {
maxSum = sum;
}
}
}
return maxSum;
}
结果展示: