子数组最大累加和

public static int function(int[] array) {
        int cur = array[0];
        int max = array[0];
        for (int i = 1; i < array.length; i++) {
            cur = cur < 0 ? 0 : cur;
            cur += array[i];
            max = Math.max(max, cur);
        }
        return max;
    }
原文地址:https://www.cnblogs.com/caobojia/p/6763037.html