475 · 二叉树的最大路径和 II
方法1:DFS
public int maxPathSum2(TreeNode root) {
if(root == null) return 0;
int res = dfs(root);
return Math.max(res,root.val);
}
private int dfs(TreeNode root) {
if (root == null) return 0;
int l = dfs(root.left);
int r = dfs(root.right);
return Math.max(l + root.val, r + root.val);
}