题解 | #连续子链表最大和#

/*
 * function ListNode(x){
 *   this.val = x;
 *   this.next = null;
 * }
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param head ListNode类 
 * @return int整型
 */
function FindGreatestSumOfSubArray( head ) {
    // write code here
    if(!head) return null
    if(!head.next) return head.val
    let node = head.next
    let res = head.val
    let pre = head.val
    while(node) {
        if(pre <= 0) {
            pre = node.val
        } else {
            pre = node.val + pre
        }
        res = Math.max(res, pre)
        node = node.next
    }
    return res
}
module.exports = {
    FindGreatestSumOfSubArray : FindGreatestSumOfSubArray
};