给定一个数组,求数组中最大连续子序列的和

public static int maxSubArray(int[] nums)
 {
 int length = nums.length;
 if(length <= 0)
 return 0;
 int CurSum = 0;
 int max = Integer.MIN_VALUE;
 for(int i = 0; i < length; i++)
 {
 if(CurSum <= 0) //当当前的和小于等于0，那么就给其置为当前元素的值
 CurSum = nums[i];
 else
 CurSum += nums[i];
 if(CurSum > max)
 max = CurSum;
 }
 return max;
 }