Leetcode 543（Java）

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Example:
Given a binary tree
1
/ \
2 3
/ \
4 5
Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

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

题目告诉我们直径路径不一定经过根结点，但是可以知道不管这条路径是怎样的，它所对应的二叉树一定有一个属于自己的根结点。
认清了这点以后，我们可以遍历这棵二叉树的所有结点作为根结点来寻找最大的路径长度。
一个结点所对应树的直径路径应该为其左子树的路径直径加上其右子树的路径直径。此话一出，递归是没跑了。AC码如下：

public class Solution {
    int maxLen =0;
    public int diameterOfBinaryTree(TreeNode root) {
        pathLen(root);
        return maxLen;
    }

    public int pathLen(TreeNode root){
        if(root==null){
            return 0;
        }
        int left = pathLen(root.left);
        int right = pathLen(root.right);
        maxLen = Math.max(maxLen, left+right);
        return Math.max(left+1, right+1);
    }
}