【2022初春】【LeetCode】【树】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 max = 0;
    public int diameterOfBinaryTree(TreeNode root) {
        if(root==null) return 0;
        dfs(root);
        return max;
       
    }

    int dfs(TreeNode root){
        if(root==null) return 0;
        int a = dfs(root.left);
        int b = dfs(root.right);
        max = Math.max(max,a+b);     
        return Math.max(a,b)+1;
    }
}

/**
 * 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 {
    public int diameterOfBinaryTree(TreeNode root) {
        if(root==null) return 0;
        int a = dfs(root.left,0);
        int b = dfs(root.right,0);
        //System.out.println(a + " " + b);
        return Math.max(Math.max(diameterOfBinaryTree(root.left),diameterOfBinaryTree(root.right)),a+b);
        

    }
    int dfs(TreeNode root, int depth){
        if(root==null) return depth;
        depth++;
        return Math.max(dfs(root.left,depth),dfs(root.right,depth));
    }
}