子数组最大累加和问题-java

import java.util.*;


public class Solution {
    /**
     * max sum of the subarray
     * @param arr int整型一维数组 the array
     * @return int整型
     */
    public int maxsumofSubarray (int[] arr) {

        if(arr.length == 0) {
            return 0;
        }

        int leftBound = 0, rightBound = 0;
        int maxSum = arr[0], tempSum = 0;

        while(rightBound < arr.length) {
            tempSum += arr[rightBound];
            maxSum = tempSum > maxSum ? tempSum : maxSum;
            ++rightBound;

            if(tempSum <= 0) {
                leftBound = rightBound;
            }
        }
        return maxSum;
    }
}