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
| var maxSum int
func maxPathSum(root *TreeNode) int {
maxSum = math.MinInt32
findMaxPathSum(root)
return maxSum
}
func findMaxPathSum(node *TreeNode) int {
if node == nil {
return 0
}
leftMax := max(findMaxPathSum(node.Left), 0)
rightMax := max(findMaxPathSum(node.Right), 0)
currentPathSum := node.Val + leftMax + rightMax
maxSum = max(maxSum, currentPathSum)
return node.Val + max(leftMax, rightMax)
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
|