forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgwbaik9717.js
More file actions
47 lines (39 loc) · 1.02 KB
/
gwbaik9717.js
File metadata and controls
47 lines (39 loc) · 1.02 KB
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
// Time complexity: O(n)
// Space complexity: O(n)
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {number}
*/
var maxPathSum = function (root) {
let answer = Number.MIN_SAFE_INTEGER;
const dfs = (current) => {
const candidates = [current.val];
if (current.left) {
dfs(current.left);
candidates.push(current.left.val + current.val);
}
if (current.right) {
dfs(current.right);
candidates.push(current.right.val + current.val);
}
// 현재 노드가 루트일 경우
if (current.left && current.right) {
answer = Math.max(
answer,
current.left.val + current.right.val + current.val
);
}
current.val = Math.max(...candidates);
answer = Math.max(answer, current.val);
};
dfs(root);
return answer;
};