子数组的最大累加和问题

/** * Created by lxw, [e-mail] on 2017/10/26. */public class MaxSum {    public int maxSum(int[] arr){        if(arr == null || arr.length ==0)            return 0;        int max = Integer.MIN_VALUE;        int cur =0;        for(int i=0; i< arr.length; i++){            cur += arr[i];            max = Math.max(max, cur);            cur = cur>0?cur:0;        }        return max;    }}