《算法导论》学习笔记——最大子段和

最大子段和问题也是用的分治算法。
最大子段和的分布，大致可分布在如下区间：

1. 完全位于子数组A[low, mid]中，因此low <= i <= j <= mid
2. 完全位于子数组A[mid + 1, high]中，因此mid < i <=j <= high
3. 跨越了中点，因此low <= i <=mid < j <= high

Java代码

public class MyClass {
    public static void main(String[] stgd) {
//        int[] numbers = new int[]{0, 1, 2, -9, -5, 7, -8};
        int[] numbers = new int[]{0, 13, -3, -25, 20, -3, -16, -23, 18, 20, -7, 12, -5, -22, 15, -4, 7};
        int low = 1;
        int high = numbers.length - 1;
        int result[] = findMaximumSubarray(numbers, low, high);
        System.out.println("左边边界 = " + result[0]);
        System.out.println("右边边界 = " + result[1]);
        System.out.println("最大子段和 = " + result[2]);
    }

    static int[] findMaximumSubarray(int a[], int left, int right) {
        int midsum = 0;
        int[] leftsum, rightsum;
        int[] sum = new int[3];
        int center;
        if (left == right){
            sum[0] = left;
            sum[1] = right;
            sum[2] = a[left];
            return sum;
        }
        else {
            center = (left + right) / 2;
            //以center为中点，求出左边最大值
            leftsum = findMaximumSubarray(a, left, center);
            //以center为中点，求出右边最大值
            rightsum = findMaximumSubarray(a, center + 1, right);
            //求出横跨center的和
            int[] maximumSubarray = findMaximumSubarray(a, left, center, right);
            //最大子段和分布在左边
            if (maximumSubarray[2] <= leftsum[2] && leftsum[2] >= rightsum[2]){
                sum[0] = leftsum[0];
                sum[1] = leftsum[1];
                sum[2] = leftsum[2];
            }
            //最大子段和分布在右边
            else if (rightsum[2] >= leftsum[2] && rightsum[2] >= maximumSubarray[2]){
                sum[0] = rightsum[0];
                sum[1] = rightsum[1];
                sum[2] = rightsum[2];
            }
            //最大子段和在中间
            else{
                sum[0] = maximumSubarray[0];
                sum[1] = maximumSubarray[1];
                sum[2] = maximumSubarray[2];

            }
        }
        return sum;
    }

    private static int[] findMaximumSubarray(int[] a, int left, int center, int right) {
        int s1, s2, lefts, rights;
        int[] result = new int[3];
        int leftIndex = 0, rightIndex = 0;
        s1 = -9999;
        lefts = 0;
        for (int j = center; j >= left; j--) {
            lefts += a[j];
            if (lefts > s1){
                s1 = lefts;
                leftIndex = j;
            }
        }
        s2 = -9999;
        rights = 0;
        for (int i = center + 1; i <= right; i++) {
            rights += a[i];
            if (rights > s2){
                s2 = rights;
                rightIndex = i;
            }
        }
        result[0] = leftIndex;
        result[1] = rightIndex;
        result[2] = s1 + s2;
        return result;

    }

}