//思路:1 全负数:取最大的数即可 2 存在非负数:遇见负数就不加,然后和前一个子序列的和做比较,取大的
public class MaxChildArray {
public static int MaxSumChild(int[] items) {
// 全是负数就取最大的负数
if (judgeISAllNegative(items)) {
for (int i = 0; i < items.length - 1; i++) {
if (items[i] > items[i + 1]) {
items[i] ^= items[i + 1];
items[i + 1] ^= items[i];
items[i] ^= items[i + 1];
}
}
return items[items.length - 1];
}
// 不是全负数的情况,sum必定大于等于0
int sum = 0;
int partSum = 0;
int current = 0;
for (int i = 0; i < items.length; i++) {
current = items[i];
if (current > 0) {
partSum += current;
} else {
sum = Math.max(sum, partSum);
partSum = 0;
}
}
return Math.max(sum, partSum);
}
// 判断一个数组是否全是负数
public static boolean judgeISAllNegative(int[] items) {
for (int i : items) {
if (i >= 0) {
return false;
}
}
return true;
}
public static void main(String[] args) {
System.out.println(MaxSumChild(new int[] { 0, 0, 1, 1, -3, -4, 1, 2, 3, 4, 5, -6, -7, 0, 23, 1, -9 }));
}
}
public class MaxChildArray {
public static int MaxSumChild(int[] items) {
// 全是负数就取最大的负数
if (judgeISAllNegative(items)) {
for (int i = 0; i < items.length - 1; i++) {
if (items[i] > items[i + 1]) {
items[i] ^= items[i + 1];
items[i + 1] ^= items[i];
items[i] ^= items[i + 1];
}
}
return items[items.length - 1];
}
// 不是全负数的情况,sum必定大于等于0
int sum = 0;
int partSum = 0;
int current = 0;
for (int i = 0; i < items.length; i++) {
current = items[i];
if (current > 0) {
partSum += current;
} else {
sum = Math.max(sum, partSum);
partSum = 0;
}
}
return Math.max(sum, partSum);
}
// 判断一个数组是否全是负数
public static boolean judgeISAllNegative(int[] items) {
for (int i : items) {
if (i >= 0) {
return false;
}
}
return true;
}
public static void main(String[] args) {
System.out.println(MaxSumChild(new int[] { 0, 0, 1, 1, -3, -4, 1, 2, 3, 4, 5, -6, -7, 0, 23, 1, -9 }));
}
}