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

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param array int整型一维数组 
 * @return int整型一维数组
 */
function FindGreatestSumOfSubArray( array ) {
    // write code here
    let a = [0]
    let b = 0
    let dp = [array[0]]
    for(let i = 1 ;i < array.length ; i++){
        if(dp[i-1]>=0){
            dp[i] = dp[i-1] + array[i]
            a[i] = a[i-1]
        }else{
            dp[i] = array[i]
            a[i] = i
        }
    }

    b = dp.lastIndexOf(Math.max.apply(null,dp))
    return array.slice(a[b],b+1)
    
}
module.exports = {
    FindGreatestSumOfSubArray : FindGreatestSumOfSubArray
};