课堂笔记之最大子数组问题

public class test {
    public static void main(String[] args) {
        int[] array = {1,2,-4,5,6,-7,8,3,0,10};
        test t = new test();
        System.out.println(t.maxArray(array,array.length));
    }

    public int maxxy(int x,int y){
        return (x>y)?x:y;
    }

    public int maxArray(int[] array,int n){
        int maxA = array[n-1];
        int sumA = array[n-1];
        for(int i = n-2;i>=0;i--){
            sumA = maxxy(array[i],array[i]+sumA);
            maxA = maxxy(sumA,maxA);
        }
        return maxA;
    }
}

　　代码不规范或有bug问题还请各位大佬多多指正。