輸入一個整形數(shù)組，數(shù)組里有正數(shù)也有負數(shù)。數(shù)組中連續(xù)的一個或多個整數(shù)組成一個子數(shù)組，每個子數(shù)組都有一個和。 求所有子數(shù)組的和的最大值

public class MaxSubArray {
    public int maxSubArray(int[] a, int n) {
        //保存當前和
        int curSum = 0;
        //最大和
        int maxSum = 0;
        for (int i = 0; i < n; i++) {
            //加入下一個元素是否會獲得更大的結(jié)果，如果更大，子數(shù)組連續(xù)，否則尋找新數(shù)組
            curSum = (a[i] > a[i] + curSum) ? a[i] : a[i] + curSum;
            //保存最大結(jié)果
            maxSum = (maxSum > curSum) ? maxSum : curSum;
        }
        return maxSum;
    }

    public static void main(String[] args) {
        int[] a = { 1, -5, 4, 6, -3, 9 };
        MaxSubArray maxSubArray = new MaxSubArray();
        System.out.println(maxSubArray.maxSubArray(a, 6));
    }
}