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

/**
 * Created by WHZ on 2017/4/6.
 */
public class offer31 {

    static int FindGreatestSumOfSubArray(int[] data){
        if(data==null||data.length<=0){
            return 0;
        }
        int max = data[0];
        int sum = 0;
        for(int i=0;i<data.length;i++){
            if(sum<=0){
                sum = data[i];
            }else{
                sum+= data[i];
            }
            if(sum>max){
                max = sum;
            }
        }
        return max;
    }

}