剑指offfer30连续子数组最大和 动态规划

public class Solution {
    public int FindGreatestSumOfSubArray(int[] array) {
        int len=array.length;
        int dp[]=new int[len];
        int max=array[0];
        dp[0]=array[0];
        for(int i=1;i<len;i++)
        {
            int newm=dp[i-1]+array[i];
            if(newm>array[i])
                dp[i]=newm;
            else
                dp[i]=array[i];
            if(dp[i]>max)
                max=dp[i];
        }
        return max;
    }
}