[lintcode medium]Continuous Subarray Sum

public class Solution {
    /**
     * @param A an integer array
     * @return  A list of integers includes the index of the first number and the index of the last number
     */
    public ArrayList<Integer> continuousSubarraySum(int[] A) {
        // Write your code here
        ArrayList<Integer> list=new ArrayList<Integer>();
        if(A.length==0 || A==null) return list;
        
        int n=A.length;
        int curleft=0;
        int curSum=0;
        
        int maxSum=Integer.MIN_VALUE;
        int maxleft=0;
        int maxright=0;
        
        for(int i=0;i<n;i++)
        {
            curSum=curSum+A[i];
            
            if(curSum>maxSum)
            {
                maxSum=curSum;
                maxleft=curleft;
                maxright=i;
            }
            
            if(curSum<0)
            {
                if(i+1<n-1)
                {
                    curSum=0;
                    curleft=i+1;
                }
            }
        }
        
        list.add(maxleft);
        list.add(maxright);
        
        return list;
    }
}