leetcode-javascript-python3/124. Binary Tree Maximum Path Sum.js at master · drjkuo/leetcode-javascript-python3 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var maxPathSum = function(root) {
    var max = -Infinity;
    helper(root);
    return max;


    function helper(root) {
        if (root === null) return 0;

        var left = Math.max(helper(root.left), 0);
        var right = Math.max(helper(root.right), 0);
        max = Math.max(max, root.val+left+right);
        return root.val + Math.max(left, right);
    }
};


/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var maxPathSum = function(root) {
    var max = -Infinity;
    helper(root);
    return max;

    function helper(root) {
        if (root === null) return 0;

        var left = Math.max(0, helper(root.left));
        var right = Math.max(0, helper(root.right));
        max = Math.max(max, left+right+root.val);

        return Math.max(root.val+left, root.val+right)

    }
};


/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */

/**
 * @param {TreeNode} root
 * @return {number}
 */
var maxPathSum = function(root) {
    var max = -Infinity;
    helper(root);
    return max;

    function helper(root) {
        if (root ===null) return 0;

        var left = Math.max(0, helper(root.left));
        var right = Math.max(0, helper(root.right));
        max = Math.max(max, left+right+root.val);

        return root.val+Math.max(left, right);
    }
};


/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var maxPathSum = function(root) {
    var max = -Infinity;
    helper(root);
    return max;


    function helper(root) {
        if (root === null) return null;

        var left = Math.max(0, helper(root.left));
        var right = Math.max(0, helper(root.right));

        max = Math.max(max, root.val+left+right);

        return root.val + Math.max(left, right);

    }

};