课堂练习:最大子数组

参考了一篇学长的博客,受益匪浅,

通过不断累加,当和变成负数归零从一个数开始加,之前的结果保存到max,每一次的结果都跟max对比,保证只要不低于0的负数都可以加进来

public class text {
    public static void main(String[] args) {

        System.out.print("输入数组长度:" );
        Scanner cin = new Scanner(System.in);
        int[] list = new int[1000000];
        int n = cin.nextInt();
        for (int i = 0; i < n; i++) {
            list[i] = cin.nextInt();
        }

        int max = list[0];
        int result = 0;

        for (int j = 0; j < n; j++)
        {
            result = result + list[j];
            if(result > max)
            {
                max = result;
            }
            else if ( result < 0)
            {
                result = 0;
            }
        }
        System.out.print("最大子数组:" );
        System.out.print(max);
    }
}