LeetCode687. Longest Univalue Path

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 TreeNode {
    int val;
    TreeNode left;
    TreeNode right;

    TreeNode(int x) {
        val = x;
    }
}

关键点1：

使用递归方法；

关键点2：

注意根结点：要考虑跨越根结点的情况。每次递归，返回的都是不跨越根结点的最长路径，递归完之后进行处理。

方法一：

int ans = 0;

public int longestUnivaluePath(TreeNode root) {
    arrowLength(root);
    return ans;
}

public int arrowLength(TreeNode node) {
    if (node == null)
        return 0;
    int left = arrowLength(node.left);
    int right = arrowLength(node.right);
    int curLeft = 0;
    int curRight = 0;
    if (node.left != null && node.val == node.left.val) {
        curLeft = left + 1;
    }
    if (node.right != null && node.val == node.right.val) {
        curRight = right + 1;
    }
    ans = Math.max(ans, curLeft + curRight);
    return Math.max(curLeft, curRight);
}

方法一思路的总结：

• ans 是全局定义的，然后在函数arrowLength()中被改变；函数arrowLength()的int型返回值只在函数内部起作用；
• 代码的核心部分是下面的代码，这里就是处理根结点与左右结点的值相等的情况以及跨越根结点的情况；

int curLeft = 0;
int curRight = 0;
if (node.left != null && node.val == node.left.val) {
    curLeft = left + 1;
}
if (node.right != null && node.val == node.right.val) {
    curRight = right + 1;
}
ans = Math.max(ans, curLeft + curRight);
return Math.max(curLeft, curRight);