LeetCode 124: Binary Tree Maximum Path Sum

Binary Tree Maximum Path Sum

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.

For example:
Given the below binary tree,

   1
  / \
 2   3

Return 6.

解题思路

注意节点的值可以是负数。代码如下：

/**
 * 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 {
private:
    int maxPathSum(TreeNode* root, int &maxSum) {
        if (root == NULL) return 0;

        int left = maxPathSum(root->left, maxSum);
        int right = maxPathSum(root->right, maxSum);

        int sum = root->val;
        if (left > 0) sum += left;
        if (right > 0) sum += right;
        maxSum = max(maxSum, sum);

        return max(root->val, max(left + root->val, right + root->val));
    }

public:
    int maxPathSum(TreeNode* root) {
        int maxSum = INT_MIN;
        maxPathSum(root, maxSum);
        return maxSum;

    }
};