leetcode 543. Diameter of Binary Tree
来源:互联网 发布:网络维护维修预算 编辑:程序博客网 时间:2024/06/08 04:10
leetcode 543. Diameter of Binary Tree
一.这道题考察的是对题目的理解,主要是最长路径不一定是经过根的。也就是树的diameter为
max(左子树的diameter,右子树的diameter,左子树深度+右子树深度) 注意路径长度是边的数量,所以max的最后一项不要加1
二. 其实真不简单。 难的是思路。题目tag竟然写easy好伤心。。
三.代码
class Solution {
public:
int diameterOfBinaryTree(TreeNode* root) {
int lmax;
int rmax;
int lrmax;
int ldepth;
int rdepth;
if(!root)
return 0;
lmax = diameterOfBinaryTree(root->left);
rmax = diameterOfBinaryTree(root->right);
lrmax = max(lmax,rmax);
ldepth = depth(root->left);
rdepth = depth(root->right);
return max(lrmax,ldepth+rdepth);
}
int depth(TreeNode *root) //求树的深度
{
if(!root)
return 0;
return (max(depth(root->left),depth(root->right))+1);
}
};
- Leetcode-543. Diameter of Binary Tree
- [leetcode] 543. Diameter of Binary Tree
- 【Leetcode】543. Diameter of Binary Tree
- [LeetCode]543. Diameter of Binary Tree
- [LeetCode]543. Diameter of Binary Tree
- leetcode-543. Diameter of Binary Tree
- [leetcode]-543. Diameter of Binary Tree
- LeetCode 543. Diameter of Binary Tree
- (LeetCode) 543. Diameter of Binary Tree
- leetcode 543. Diameter of Binary Tree
- LeetCode 543. Diameter of Binary Tree
- [leetcode]: 543. Diameter of Binary Tree
- [leetcode: Python]543. Diameter of Binary Tree
- leetcode 543. Diameter of Binary Tree
- Leetcode 543. Diameter of Binary Tree
- [LeetCode] 543. Diameter of Binary Tree
- LeetCode-543. Diameter of Binary Tree (Java)
- Leetcode-543. Diameter of Binary Tree
- C#里partial关键字的作用(转摘)
- 跳转等待页面
- 第一弹:微信小程序开发思考总结—“文章阅读器和电影信息”项目实践---序言、准备工作、项目构架
- 素数快速求法 -- 筛法求素数
- 渣渣渣变渣渣系列(8)
- leetcode 543. Diameter of Binary Tree
- 100、类加载和反射
- windows 10家庭版关闭Defender
- 数论
- 重命名文件
- android 反射机制
- 2017IT在线教育机构汇总
- 程序人生之真正女程序员是什么样的
- Android Studio 报错 Error:Some file crunching failed, see logs for details