【剑指Offer】42. 连续子数组的最大和

public class Solution {
    public int FindGreatestSumOfSubArray(int[] array) {
        if(array.length == 0 || array == null)
            return 0;
        
        int curmax = Integer.MIN_VALUE;
        int sum = 0;
        for(int i : array) {
            sum = sum<=0 ? i : sum+i;
            curmax = Math.max(sum, curmax);
        }
        return curmax;
    }
}