/**
* 最大子数组问题算法(优化的蛮力法)(重复利用已经计算的子数组和,相比较方法一,时间复杂度为:O(n^2))
*/
private static void getSumOfSubArray02(int array[]) {
int n = array.length;
int thisSum, maxSum = Integer.MIN_VALUE, i, j;
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
thisSum = 0;
thisSum = thisSum + array[j];
if (thisSum > maxSum) {
maxSum = thisSum;
}
}
}
System.out.println("最大子数组之和为:" + maxSum);
}