687. Longest Univalue Path

Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the root.

Note: The length of path between two nodes is represented by the number of edges between them.

Example 1:

Input:

              5
             / \
            4   5
           / \   \
          1   1   5

Output:

2

Example 2:

Input:

              1
             / \
            4   5
           / \   \
          4   4   5

Output:

2

Note: The given binary tree has not more than 10000 nodes. The height of the tree is not more than 1000.

思路：无非就是想明白怎么递归

class Solution {
    public int longestUnivaluePath(TreeNode root) {
    	if(root == null)	return 0;
    	int ret = Math.max(longestUnivaluePath(root.left), longestUnivaluePath(root.right));
        ret = Math.max(getMax(root.left, root.val)+getMax(root.right, root.val), ret);
        return ret;
    }

	private int getMax(TreeNode root, int val) {
		if(root == null || root.val != val)		return 0;
		return 1+Math.max(getMax(root.left, val), getMax(root.right, val));
	}
}