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.

Solution:

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