forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhoyeongkwak.ts
More file actions
33 lines (30 loc) · 946 Bytes
/
hoyeongkwak.ts
File metadata and controls
33 lines (30 loc) · 946 Bytes
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
/**
* Definition for a binary tree node.
* class TreeNode {
* val: number
* left: TreeNode | null
* right: TreeNode | null
* constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
* }
*/
/*
Time complexity: O(N)
Space complexity: O(N) h: 트리의 높이
*/
function maxPathSum(root: TreeNode | null): number {
let maxSum = -Infinity
const dfs = (node: TreeNode): number => {
if (node == null) return 0
const leftMax = Math.max(0, dfs(node.left))
const rightMax = Math.max(0, dfs(node.right))
const currentMax = node.val + leftMax + rightMax
maxSum = Math.max(maxSum, currentMax)
return node.val + Math.max(leftMax, rightMax)
}
dfs(root)
return maxSum
};