如何求最大子数列之和

1 暴力方法

把所有子列和都求出来

public class Demo07 {
   

	public static void method(int[] a) {
   
		int max = Integer.MIN_VALUE;
		int begin = -1;
		int end = -1;
		int len = a.length;
		int sum = 0;
		for (int i = 0; i < len; i++) {
   // 子数列的开头

			for (int j = i; j < len; j++) {
   // 子数列的结尾
				sum = 0;
				for (int k = i; k <= j; k++) {
   // 计算子数列的和
					sum += a[k];
				}
				if (sum > max) {
   
					max = sum;
					begin = i;
					end = j;
				}
			}
		}
		System.out.println("最大子列和为：" + max + ", 子列开始序号为：" + begin + ", 子列结束序号为：" + end);
	}

	public static void main(String[] args) {
   
		int[] a = {
    1, -5, -9, <