[LeetCode]Maximum Subarray

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.

public class Solution {
    public int maxSubArray(int[] A) {
        if(A.length == 1) return A[0];
        int max = A[0];
        int sum = A[0];
        for(int i = 1;i<A.length;i++){
        	sum = Math.max(sum+A[i],A[i]);
        	max = Math.max(sum,max);
        }
        return max;
    }
}

[LeetCode]Maximum Subarray

原文：http://blog.csdn.net/guorudi/article/details/39894167