public class Solution { public int FindGreatestSumOfSubArray(int[] array) { if (array == null || array.length == 0) { return 0; } int max = array[0]; for (int i = 1; i < array.length; i++) { if (array[i-1] >= 0) { array[i] += array[i-1]; } if (max < array[i]) { max = array[i]; } } return max; } }