蛮力法肯定会超时,只能过50%用例
public static int FindGreatestSumOfSubArray(int[] array) {
int max = array[0];
int index = 0;
while (index <= array.length - 1) {
int index2 = index;
int sum = 0;
while (index2 <= array.length - 1) {
for (int i = index; i <= index2; i++) {
sum += array[i];
}
if (sum > max) {
max = sum;
}
sum = 0;
index2++;
}
index++;
}
return max;
}