/**
* 最大子数组问题算法(蛮力法 O(n^3))
*/
private static void getSumOfSubArray01(int array[]) {
int n = array.length;
int thisSum, maxSum = Integer.MIN_VALUE, k, i, j;
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
thisSum = 0;
System.out.print("子数组有:");
for (k = i; k <= j; k++) { //k j分别为子数组的起止位置
thisSum = thisSum + array[k];
System.out.print(array[k] + " ");//输出所有的子数组是哪些
}
if (thisSum > maxSum) {
maxSum = thisSum;
}
}
}
System.out.println("最大子数组之和为:" + maxSum);
}