java version:求子数组的最大和

//求子数组的最大和
private static void findMaxSum(int data[]){
int len  ;
if(null == data || (len=data.length) == 0){
return;
}
int curSum =0;
int maxSum = 0;
int maxValue = data[0];
int curValue;
for(int i=0; i<len ;i++){
curValue =  data[i];
if(curValue > maxValue){
maxValue = curValue;
}
curSum  += curValue;
if(curSum < 0){
curSum = 0;
}
if(curSum > maxSum){
maxSum = curSum;
}
}
//如果全是负数，则sum=最大值
if(maxValue < 0 ){
maxSum = maxValue;
}
System.out.println("maxSunSum="+maxSum);
}