public class Solution {
    
    
    public int FindGreatestSumOfSubArray(int[] array) {
    
    
        int[] dp = new int[array.length];
        //记录最大值
        int max = array[0];
        dp[0] = array[0];
        for(int i=1;i<array.length;i++){
    
    
            int temp = dp[i-1] + array[i];
            if(array[i] > temp){
    
    
                dp[i] = array[i];
            }else{
    
    
                dp[i] = temp;
            }
            if(dp[i]>max){
    
    
                max = dp[i];
            }
        }
        return max;
    }
}