class Solution {
int ans = 0;
public int diameterOfBinaryTree(TreeNode root) {
if (root == null)
return 0;
depth(root);
return ans;
}
private int depth(TreeNode node) {
if (node == null)
return 0; // 递归终止条件
int leftDepth = depth(node.left);
int rightDepth = depth(node.right);
ans = Math.max(ans, leftDepth + rightDepth);
return Math.max(leftDepth, rightDepth) + 1;
}
}
Hot100【七十三】:543. 二叉树的直径
最新推荐文章于 2024-07-15 22:10:26 发布