Test

 * 算法问题描述

 *-----------------------------------------------------------------------------------------------

 * 给定长度为n的整数序列，a[1...n], 求[1,n]某个子区间[i , j]使得a[i]+…+a[j]和最大。

 *

 * 例如(-2,11,-4,13,-5,2)的最大子段和为20,所求子区间为[2,4]，子序列是(11，-4,13)，最大子段和是20。

 *===============================================================================================

array = [-2,11,-4,13,-5,-2]
def printSegment(array1):
    for x in array1:
        print(x,end = ' ')
print('原序列是：')
printSegment(array)

def maxsum(array1):
    sum = 0
    b = 0
    for x in array1:
        if b > 0:
            b += x
        else:
            b = x
        if b > sum:
            sum = b
    return sum
print()
print('最大子段和：',end = '')
print(maxsum(array))

public class MaxSum {
	public static void main(String[] args) {
		int[] array = {-2,11,-4,13,-5,-5,-2};
		System.out.println("The Original Array:");
		printSegment(0,array.length - 1,array);
		int maxSum=maxSum(array);
		System.out.println("The biggest Sum: " + maxSum);
	}
	private static int maxSum(int[] array){
		int sum = 0;
		int b = 0;
		for(int i=0;i<array.length;i++) {
			if(b>0){
				b += array[i];
			} else {
				b = array[i];
			}
			if (b>sum) {
				sum = b;
			}
		}
		return sum;
	}

	private static void printSegment(int start,int end,int[] array){
		for (int i = start;i <= end;i++){
			System.out.print(array[i] + "  ");
		}
		System.out.println();
	}
}