53. 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.

public class Solution {
    public int maxSubArray(int[] A) {
        int maxGlobal = Integer.MIN_VALUE, maxCurrent = 0;
        for(int i = 0; i<A.length; i++){
            maxCurrent = maxCurrent>0?maxCurrent+A[i]:A[i];
            maxGlobal = Math.max(maxGlobal, maxCurrent);
        }
        return maxGlobal;
    }
}