Max Path Sum In Binary Tree

Prompt

Write a function that takes in a Binary Tree and returns its max path sum. A path is a collection of connected nodes in a tree where no node is connected to more than two other nodes; a path sum is the sum of the values of the nodes in a particular path.
Each BinaryTree node has an integer value , a left child node, and a right child node. Children nodes can either be BinaryTree nodes themselves or None / null .

Sample Input

Sample Output

10

---

Solution

import java.util.*;

class Program {
  public static int maxPathSum(BinaryTree tree) {
		List<Integer> maxSumArray = findMaxSum(tree);// A
    return maxSumArray.get(1);// B
  }
	
	public static List<Integer> findMaxSum(BinaryTree tree) {
		if (tree == null) {
			return new ArrayList<Integer> (Arrays.asList(0, Integer.MIN_VALUE));
		}
		List<Integer> leftMaxSumArray = findMaxSum(tree.left);
		Integer leftMaxSumAsBranch = leftMaxSumArray.get(0);
		Integer leftMaxPathSum = leftMaxSumArray.get(1);
		
		List<Integer> rightMaxSumArray = findMaxSum(tree.right);
		Integer rightMaxSumAsBranch = rightMaxSumArray.get(0);
		Integer rightMaxPathSum = rightMaxSumArray.get(1);
		
		Integer maxChildSumAsBranch = Math.max(leftMaxSumAsBranch, rightMaxSumAsBranch);
		Integer maxSumAsBranch = Math.max(maxChildSumAsBranch + tree.value, tree.value);
		Integer maxSumAsRootNode =
			Math.max(leftMaxSumAsBranch + tree.value + rightMaxSumAsBranch,maxSumAsBranch);
		int maxPathSum = Math.max(maxSumAsRootNode, Math.max(leftMaxPathSum, rightMaxPathSum)); // C
		return new ArrayList<Integer> (Arrays.asList(maxSumAsBranch, maxPathSum));
	}

  static class BinaryTree {
    public int value;
    public BinaryTree left;
    public BinaryTree right;

    public BinaryTree(int value) {
      this.value = value;
    }
  }
}

# A

当需要两个返回值的时

# B

• the methond of int [ ] & List

# C

Math.max( ) 只可以比较两个值的大小