124. binary-tree-maximum-path-sum, golang

最新推荐文章于 2024-10-04 21:49:15 发布

sky527759

最新推荐文章于 2024-10-04 21:49:15 发布

阅读量121

点赞数

分类专栏： leetcode-myself 文章标签： golang leetcode

本文链接：https://blog.csdn.net/sky527759/article/details/121062091

版权

leetcode-myself 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

这篇博客探讨了一种解决二叉树最大路径和问题的高效算法，通过递归和动态规划，找出任意路径中节点值之和的最大值。它介绍了如何在`maxPathSum`函数中使用`getSum`辅助函数，并展示了如何在树结构中找到最优路径。适合深入理解动态规划在树形结构中的应用。

摘要由CSDN通过智能技术生成

description:

124. Binary Tree Maximum Path Sum
Hard

7460

460

Add to List

Share
A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.

The path sum of a path is the sum of the node's values in the path.

Given the root of a binary tree, return the maximum path sum of any path.

 

Example 1:


Input: root = [1,2,3]
Output: 6
Explanation: The optimal path is 2 -> 1 -> 3 with a path sum of 2 + 1 + 3 = 6.
Example 2:


Input: root = [-10,9,20,null,null,15,7]
Output: 42
Explanation: The optimal path is 15 -> 20 -> 7 with a path sum of 15 + 20 + 7 = 42.
 

Constraints:

The number of nodes in the tree is in the range [1, 3 * 104].
-1000 <= Node.val <= 1000
Accepted
607,540
Submissions
1,652,069

code:

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func maxPathSum(root *TreeNode) int {
    
    var res = -1 << 63
    getSum(root, &res)
    return res
}

func getSum(root *TreeNode, res *int) (sum int) {
    
    if root == nil {
        return
    }
    
    var left = max(getSum(root.Left, res), 0)
    var right = max(getSum(root.Right, res), 0)
    if sum = root.Val + left + right; sum > *res {
        *res = sum
    }
    sum = root.Val+ max(left, right)
    return
}

func max(a, b int) int {
    if a > b {
        return a
    }
    return b
}