leetcode124. 二叉树中的最大路径和

1、题目

https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/submissions/

2、题意

题解1：递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int res = INT_MIN;
    int maxPathSum(TreeNode* root) {
        dfs(root);
        return res;
    }
    int dfs(TreeNode* root)
    {
        if(!root) return 0;
        int l = max(0,dfs(root->left));
        int r = max(0,dfs(root->right));
        res = max(res,root->val+l+r);
        return root->val+max(l,r);
    }
};