最大子列

 public static int maxSub(int[] arr) {        int maxSum = 0;        int currentSum = 0;        for (int i = 0; i < arr.length; i++) {            currentSum += arr[i];            if (currentSum > maxSum) {                maxSum = currentSum;            } else if (currentSum < 0) {                currentSum = 0;            }        }        return maxSum;    }