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 {
private int ans;
public int diameterOfBinaryTree(TreeNode root) {
dfs(root);
return ans;
}
private int dfs(TreeNode node){
if(node==null){
return 0;
}
//计算左子树最大深度,不包含当前节点
int leftMax = dfs(node.left);
//计算右子树最大深度,不包含当前节点
int rightMax = dfs(node.right);
//比较获得最大直径
ans = Math.max(leftMax+rightMax,ans);
return Math.max(leftMax,rightMax)+1;
}
}