@@ -0,0 +1,795 @@
+public class _0124BinaryTreeMaximumPathSum %7B%0A  private int max = Integer.MIN_VALUE;%0A%0A  public int maxPathSum(TreeNode root) %7B%0A    maxSide(root);%0A    return max;%0A  %7D%0A%0A  public int maxSide(TreeNode root) %7B%0A    if (root == null) %7B%0A      return 0;%0A    %7D%0A    int left = maxSide(root.left);%0A    int right = maxSide(root.right);%0A    int current = left + root.val + right;%0A    max = Math.max(max, current);%0A    int res = Math.max(0, Math.max(root.val + left, root.val + right));%0A    return res;%0A  %7D%0A%0A  public class TreeNode %7B%0A      int val;%0A      TreeNode left;%0A      TreeNode right;%0A      TreeNode() %7B%7D%0A      TreeNode(int val) %7B this.val = val; %7D%0A      TreeNode(int val, TreeNode left, TreeNode right) %7B%0A          this.val = val;%0A          this.left = left;%0A          this.right = right;%0A      %7D%0A  %7D%0A%7D%0A

Add _0124BinaryTreeMaximumPathSum