Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * Definition of TreeNode:
- * public class TreeNode {
- * public int val;
- * public TreeNode left, right;
- * public TreeNode(int val) {
- * this.val = val;
- * this.left = this.right = null;
- * }
- * }
- */
- public class Solution {
- /**
- * @param root the root of binary tree.
- * @return an integer
- */
- public int maxPathSum2(TreeNode root) {
- if (root == null) {
- return Integer.MIN_VALUE;
- }
- int left = maxPathSum2(root.left);
- int right = maxPathSum2(root.right);
- return root.val + Math.max(0, Math.max(left, right));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement