MaxConsecutiveSum solution in linear time for Coding For Interviews. http://codingforinterviews.com/

gistfile1.java

package cfi.maxconsecutivesum;

public class MaxConsecutiveSum {
  
  public static void main(String[] args) {
  	int[] input = new int[] { -1, 5, 6, -2, 20, -50, 4 };
  	System.out.println(getMaxConsecutiveSumLinear(input));
  }

  public static int getMaxConsecutiveSumLinear(int[] input) {
      // initialise to the first value instead of Integer.MIN_VALUE
      // since there is a risk we'll underflow
      int prevMax = input[0];
      int maxSum = prevMax;
      
      for (int i = 1; i < input.length; i++) {
      	if (input[i] > prevMax + input[i])
      		prevMax = input[i]; // throw away history
      	else
      		prevMax += input[i];
      	if (prevMax > maxSum)
      		maxSum = prevMax;
      }
      
      return maxSum;
  	}
}

Line 12 is indentation madness! :)

Haha, fixed.