求最长的相同的值的路径 Longest Univalue Path

2019独角兽企业重金招聘Python工程师标准>>>

问题：

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.

解决：

① 求最长的相同值路径。dfs。

class Solution {//18ms
    public int longestUnivaluePath(TreeNode root) {
        if (root == null) return 0;
        int sub = Math.max(longestUnivaluePath(root.left),longestUnivaluePath(root.right));
        return Math.max(sub,dfs(root.left,root.val) + dfs(root.right,root.val));
    }
    public int dfs(TreeNode node,int parent){
        if (node == null || node.val != parent) return 0;
        return Math.max(dfs(node.left,node.val),dfs(node.right,node.val)) + 1;
    }
}

② 另一种dfs方法

class Solution { //11ms
    int max;
    public int longestUnivaluePath(TreeNode root) {
        if(root == null) return 0;
        max = Integer.MIN_VALUE;
        dfs(root, root.val);
        return max;
    }
    private int dfs(TreeNode root, int value) {
        if(root == null) return 0;
        int left = dfs(root.left, root.val);
        int right = dfs(root.right, root.val);
        max = Math.max(max, left+right);
        if(root.val == value) return Math.max(left, right) + 1;
        return 0;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1607051