求最大子序列的和

public static int maxSubArray(int[] a){     int max = 0;      int thisSum = 0;      for (int i=0;i<a.length;i++){            thisSum += a[i];            if (thisSum>max)                max = thisSum;                 else if (thisSum<0)                thisSum = 0;        }        return max;        }