连续子数组的最大和

public class Main {
    public static int getMaxSum(int[] array) throws Exception{
        
        if (array == null && array.length == 0) {
            throw new Exception() ;
        }
        
        int maxSum = array[0];
        int tempSum = maxSum;
        for (int i = 1; i < array.length; i++) {
            if (tempSum < 0) {
                tempSum = array[i];
            } else {
                tempSum += array[i];
            }
            
            if (tempSum >= maxSum) {
                maxSum = tempSum;
            }
        }
        return maxSum;
    }
    
    public static void main(String[] args) {
        int[] array = {-1, -2, -3, -10, -4, -5, -2, -5};
        try {
            System.out.println(getMaxSum(array));
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}