题解 | #连续子数组的最大和#

function FindGreatestSumOfSubArray(array)
{
    // write code here
    let dp = []
    dp[0] = array[0]
    let n = array.length
    for (let i = 1; i < n; i++) {
        dp[i] = Math.max(dp[i-1]+array[i],array[i])
    }
    return Math.max(...dp)
    
}
module.exports = {
    FindGreatestSumOfSubArray : FindGreatestSumOfSubArray
};