LeetCode 124. Binary Tree Maximum Path Sum

最新推荐文章于 2024-03-25 21:39:45 发布

ActiveCoder

最新推荐文章于 2024-03-25 21:39:45 发布

阅读量234

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 题解

本文链接：https://blog.youkuaiyun.com/github_34333284/article/details/51422160

LeetCode 题解专栏收录该内容

288 篇文章

订阅专栏

本文介绍了一种寻找二叉树中最大路径和的算法实现。通过递归方法遍历树的每个节点，计算包含当前节点的最大路径值，并更新全局最大路径值。最终返回整棵树的最大路径和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
#include <climits>
using namespace std;
/*
  Given a binary tree, find the maximum path sum.
  For this problem, a path is defined as any sequence of nodes from some starting node
  to any node in the tree along the parent-child connections. The path does not need 
  to go through the root.
  Example:
        1
      2   3
  return 1 + 2 + 3 = 6
*/

/*
  struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
  }
*/
int maxPathSum(TreeNode* root, int& maxValue) {
  if(!root) return 0;
  int leftLegValue = maxPathSum(root->left, maxValue);
  int rightLeftValue = maxPathSum(root->right, maxValue);

  int m = root->val;
  int longerLeg = max(leftLegValue, rightLegValue);

  // maximum result which contains the root.
  int result = max(m, m + longerLeg);

  int maxPath = m;
  maxPath = max(maxPath, maxPath + leftLegValue);
  maxPath = max(maxPath, maxPath + rightLegValue);
  maxValue = max(maxValue, maxPath);
  return result;
}
int maxPathSum(TreeNode* root) {
  int maxValue = INT_MIN;
  maxPathSum(root, maxValue);
  return maxValue;
}