//二叉树节点的定义
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public class Solution {
//方法一:递归解法,时间复杂度过高
public int maxPathSum2(TreeNode root) {
if(root==null)
return 0;
int count=Math.max(maxPathSum(root.left),maxPathSum(root.right));
07-30