class Solution {
public:
int ans;
int diameterOfBinaryTree(TreeNode* root) {
ans = 1;
dfs(root);
return ans - 1;
}
int dfs(TreeNode* root){
if(root == NULL)
return 0;
int left = dfs(root->left);
int right = dfs(root->right);
ans = max(ans,right + left + 1);
return max(left,right) + 1;
}
};
二叉树的直径
最新推荐文章于 2021-04-24 01:12:57 发布