gistfile1.txt

public class TestConSum {

	public static void main(String... args) {
		
		int[] arr = new int[]{-2,11,-4,13, -9, -10,99};
		int negsum = 0;
		int maxsum = 0;
		
		for (int i = 0; i < arr.length; i++) {
			if (arr[i] < 0) {
				negsum += arr[i];
				continue;
			}
			
			if (arr[i] > 0) {
				maxsum = max(maxsum + negsum + arr[i], arr[i], maxsum);
				negsum = 0;
			}
		}
		
		System.out.println(maxsum);
	}
	
	private static int max (int a, int b, int c) {
		int tmp = a > b? a : b;
		return tmp > c? tmp : c;
	}
}

嘿嘿嘿~~小星星

what about this? {-1, -2, -3} ?

Good question.
I suppose the result is 0.

Your post of max product for consecutive nums is awesome.

也是参考别人的代码做的“微创新”，^_^

阿瑆，你这个方法真的很好！！！

{2, -3, 1}?

public class Test {

public static void main(String... args) {

    int[] arr = new int[]{-2,11,-4,13,-5,-2};

    int maxsum = Integer.MIN_VALUE;
    int currentHeight = 0;
    int minHeight = 0;

    for (int i = 0; i < arr.length; i++) {
        currentHeight += arr[i];
        maxsum = Math.max(currentHeight - minHeight, maxsum);
        minHeight = Math.min(minHeight, currentHeight);
    }

    System.out.println(maxsum);
}

}