第二周学习进度博客

package bao;

public class Grope {
    public static void main(String[] args) {
        int arr[] = { 2, -3, 4, 11, -5, 8, 3, -6 };
        int maxSum = getMaxSum2(arr);
        System.out.println("最大子数组的和为：" + maxSum);
    }

    private static int getMaxSum(int[] arr) {
        int max = -100000;
        for (int i = 0; i < arr.length; i++) {
            int sum = 0;
            for (int j = i; j < arr.length; j++) {
                sum += arr[j];
                if (max < sum) {
                    max = sum;
                }
            }
        }

        return max;
    }

    // 贪心法
    private static int getMaxSum2(int[] arr) {
        int n = arr.length;
        int max = -1000000;
        int sum = 0;
        for (int i = 0; i < n; i++) {
            sum += arr[i];
            if (sum > max) {
                max = sum;
            }
            if (sum < 0) {
                max = 0; // 子串和为负数，丢掉
            }
        }
        return max;
    }

}