Largest Continuous Sum of an Array

gistfile1.java

public Integer findSum(int[] arr) {
		if (arr.length == 0) 
			return null;

		int largestSum = arr[0];
		int currentSum = arr[0];
		for (int i = 1; i < arr.length; i++) {
			currentSum = max(currentSum + arr[i], arr[i]); // if the current sum gets negative, we reset it
			largestSum = max(currentSum, largestSum);
		}
		return largestSum;
	}

	private int max(int first, int second) {
		return first > second ? first : second;
	}