Skip to content
On this page

寻找最大子序列和

js
function findMax(arr) {
    let res = arr[0];
    let sum = 0;
    for(let i = 0;i < arr.length;i ++) {
        if(sum > 0) {
            sum += arr[i];
        } else {
            sum = arr[i];
        }
        res = Math.max(res, sum);
    }
    return res;
}