maximum-subarray Java 贪心

题目描述

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array[−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray[4,−1,2,1]has the largest sum =6.

click to show more practice.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

import java.util.*;public class Solution {    public int maxSubArray(int[] A) {        int n = A.length;        int[] sum = new int[n];        sum[0] = A[0];        int max = A[0];        for (int i = 1; i < n; i++) {            sum[i] = Math.max(A[i], sum[i - 1] + A[i]);            max = Math.max(max, sum[i]);        }        return max;    }}

看是你自己大还是你和前面的加起来的和大