求出最优子集

最新推荐文章于 2022-10-18 13:06:00 发布

置顶 zhengzhengwang

最新推荐文章于 2022-10-18 13:06:00 发布

阅读量340

点赞数

分类专栏：算法文章标签： javascript html5

本文链接：https://blog.csdn.net/zhengzhengwang/article/details/106716128

版权

算法专栏收录该内容

29 篇文章 0 订阅

订阅专栏

// function maxSum(arr = []) {
//     let tempSum = 0;
//     let maxSum = 0;
//     for (let i = 0; i < arr.length; i++) {
//         tempSum += arr[i];
//         if (tempSum > maxSum) {
//             maxSum = tempSum;
//         } else if (tempSum < 0) {
//             tempSum = 0;
//         }
//     }
//     return maxSum;
// }
function maxSum2(arr = []) {
    let dp = [];
    for (let i = 0; i < arr.length; i++) {
        if (dp[i - 1] > 0) {
            dp[i] = dp[i - 1] + arr[i];
        } else {
            dp[i] = arr[i];
        }
    }
    return Math.max(...dp)
}
function maxSum(arr = []) {
    let tempSum = 0;
    let maxSum = 0;
    for (let i = 0; i < arr.length; i++) {
        tempSum = Math.max(tempSum + arr[i], arr[i]);
        maxSum = Math.max(tempSum, maxSum)
    }
    return maxSum;
}
let arr = [-2,1,-3,4,-1,2,1,-5,4];