连续子数组的最大和

Question

public class Solution {
  public int FindGreatestSumOfSubArray(int[] array) {
    int result = array[0];
    int max = array[0];
    for (int i = 1; i < array.length; i ++){
      max = Math.max(array[i],max + array[i]);
      result = Math.max(result,max);
    }    
    return result;
  }
}