力扣刷题记录 -- JAVA--39---543. 二叉树的直径

---

一、题目

二、代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution 
{
    //求的是经过节点数 最后路径长度要建议
    int re = -1;
    public int diameterOfBinaryTree(TreeNode root) 
    {
         dfs(root);    
         return re - 1;
    }
    public int dfs(TreeNode cur)
    {
        if(cur == null) return 0;
        int left = dfs(cur.left);
        int right = dfs(cur.right);
        re = Math.max(re,left+right+1);

        return Math.max(left,right)+1;
    }
}

三、运行结果