Maximum Subarray

public class Solution {    public int maxSubArray(int[] A) {        int res = 0;        if(A.length == 0){            return res;        }        int max = A[0];        for(int i = 0 ; i < A.length ; i++){            if(res >= 0){                res = res + A[i];            }else{                res = A[i];            }            if(res > max){                max = res;            }        }        return max;    }}