Leetcode 124.二叉树中的最大路径

最新推荐文章于 2024-11-05 21:58:11 发布

月雲之霄

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量245

点赞数

文章标签： leetcode 算法 java

本文链接：https://blog.csdn.net/isunbin/article/details/120237169

版权

解法1

解法

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int maxPathSum(TreeNode* root) 
    {
        if(!root) return 0;
        int result = numeric_limits<int>::min();
        dfs(result, root);
        return result;
    }
    
    int dfs(int &result, TreeNode *root)
    {
        if(!root) return 0;
        int left = dfs(result, root->left);
        int right = dfs(result, root->right);
        
        result = max(result, root->val + left + right);
        
        int temp = max(left + root->val, right + root->val);
        
        return max(0, temp);
    }
};