【LeetCode】求二叉树的最大路径和（结点的起始位置可以是二叉树的任意两个结点）: Binary Tree Maximum Path Sum

Given a non-empty 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 must contain at least one node and does not need to go through the root.

Example 1:

Input: [1,2,3]

       1
      / \
     2   3

Output: 6

Example 2:

Input: [-10,9,20,null,null,15,7]

   -10
   / \
  9  20
    /  \
   15   7

Output: 42

代码如下：

class Solution {
public:
    int maxPathSum(TreeNode* root) {
        maxSum = INT_MIN;
        dfs(root);
        return maxSum;
    }
    
    int dfs(TreeNode* root) { // dfs的返回值是以当前结点为起始的最大值
        if (!root) return 0;
        
        int left = dfs(root->left); // 左子树的最大值
        int right