子数组的最大累加和问题

public class Client {


    public static void main(String[] args) {
        int[] ints = {3,5,-2,6};
        int cur = ints[0];
        int max = ints[0];
        for (int i = 1; i < ints.length; i++) {
            cur += ints[i];
            if(cur > max){
                max = cur;
            }
            if(cur < 0){
                cur = 0;
            }
        }

        System.out.println("max:" + max);

    }
}