[leetcode]-543. Diameter of Binary Tree
来源:互联网 发布:有问必答的语音软件 编辑:程序博客网 时间:2024/05/18 09:19
思路:
diameter保存最大的直径,每次更新该值
depthOfBinary利用分治算法计算树的深度:分解为子问题,分别求得左右子树的深度lDepth,rDepth,两者相加+2就是该节点下的最大直径。
代码:
class Solution {public: int diameter = 0; int diameterOfBinaryTree(TreeNode* root) { depthOfBinaryTree(root); return diameter; } int depthOfBinaryTree(TreeNode* root){ if(root == NULL){ return -1; } int lDepth = depthOfBinaryTree(root->left); int rDepth = depthOfBinaryTree(root->right); diameter = max(diameter,lDepth+rDepth+2); return max(lDepth, rDepth) + 1; }};
0 0
- 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
- MybatisCT——(二)
- Fliptile POJ
- python学习参考及环境配置
- EventBus3.0详解
- Java复习——对象数组
- [leetcode]-543. Diameter of Binary Tree
- Android 获取当前系统语言及地区,并更改语言
- 50. Pow(x, n)
- STM32学习之路:第十三天
- L2-019. 悄悄关注
- caffe训练图片的问题及对策
- 蓝桥杯 2016 省赛B组 四平方和 (暴力)
- 线程的常用方法
- ArrayList详细描述