leetcode六月每日一題leetcode124

一天一道題也已經100道了，堅持哦

class Solution {

private:
    int maxPathSum(TreeNode* root, int& ans){
        if(!root) return 0;
        int l = max(0,maxPathSum(root->left,ans));
        int r = max(0,maxPathSum(root->right,ans));
        int sum = l + r + root->val;
        ans = max(ans,sum);
        return max(l,r) + root->val;
    }

public:
    int maxPathSum(TreeNode* root) {

        if(!root) return 0;
        int ans = INT_MIN;
        maxPathSum(root, ans);
        return ans;
    }
};