Traditional Max subsequence sum calculator

MaxSubSum.java

public final class MaxSubSum {

    public static long forSequence(final int... array) {
        if (array == null || array.length == 0) {
            return 0L;
        }

        long sum = array[0];
        long maxSum = sum;

        for (int i = 1; i < array.length; i++) {
            final int val = array[i];
            sum = max(val, sum + val);
            maxSum = max(maxSum, sum);
        }

        return maxSum;
    }
}