剑指offer31--连续子数组的最大和

public class FindGreatestSum {
/*
* 连续子数组的最大和
*/
public Integer findGreatestSum(int[] array)
{
if(array==null)
return null;
int greatest=0;
int curSum=0;
for(int i=0;i<array.length;i++)
{
if(curSum+array[i]<0)
{
greatest=0;
curSum=0;
}
else
{
curSum=curSum+array[i];
if(curSum>greatest)
greatest=curSum;
}
}
return greatest;
}
}