剑指offer42题

package com.algorithm05;

public class Algorithm42 {
    
    public int FindGreatestSumOfSubArray(int[] array) {
        if(array.length<=0)
            return 0;
        int len = array.length;
        int nCurrSum,nMaxSum;
        nCurrSum = nMaxSum = 0;
        for(int i = 0 ; i < len ; i++){
            if(nCurrSum<=0)
                nCurrSum = array[i];
            else
                nCurrSum = nCurrSum + array[i];
            if(nCurrSum>nMaxSum)
                nMaxSum = nCurrSum;
        }
        
        return nMaxSum;
    }
    
    public static void main(String[] args) {
        Algorithm42 algorithm42 = new Algorithm42();
        int[] array = {6,-3,-2,7,-15,1,2,2};
        int max = algorithm42.FindGreatestSumOfSubArray(array);
        System.err.println(max);
    }
      
}