Find a maximum sum of a compact subsequence of array elements.

MaxSliceSum.java

public class MaxSliceSum {
	public int maxSliceSum(int[] A) {
		if(A == null || A.length == 0) {
			return 0;
		}
		
		int maxSum = Integer.MIN_VALUE;
		int tempMaxSum = 0;
		for(int i = 0; i < A.length; i++) {
			tempMaxSum = Math.max(A[i], A[i] + tempMaxSum);
			maxSum = Math.max(tempMaxSum, maxSum);
		}
		
		return maxSum;
	}
}