【LeetCode】104 Maximum Depth of Binary Tree
来源:互联网 发布:免费下载绘图软件 编辑:程序博客网 时间:2024/06/16 18:17
原题地址:104. Maximum Depth of Binary Tree。
解法
int maxDepth(TreeNode* root) { if (root == nullptr) { return 0; } else if (root->left == nullptr && root->right == nullptr) { return 1; } return max(maxDepth(root->left), maxDepth(root->right)) + 1;}
阅读全文
0 0
- Leetcode 104 Maximum Depth of Binary Tree
- LeetCode(104)Maximum Depth of Binary Tree
- LeetCode 104 Maximum Depth of Binary Tree
- LeetCode: Maximum Depth of Binary Tree [104]
- Leetcode(104)Maximum Depth of Binary Tree
- [leetcode 104] Maximum Depth of Binary Tree
- LeetCode 104 Maximum Depth of Binary Tree
- leetCode #104 Maximum Depth of Binary Tree
- LeetCode 104: Maximum Depth of Binary Tree
- LeetCode 104 Maximum Depth of Binary Tree
- leetcode || 104、Maximum Depth of Binary Tree
- LeetCode 104: Maximum Depth of Binary Tree
- leetcode[104]:Maximum Depth of Binary Tree
- Leetcode[104]-Maximum Depth of Binary Tree
- Leetcode---(104)Maximum Depth of Binary Tree
- leetcode-104-Maximum Depth of Binary Tree
- Leetcode #104 Maximum Depth of Binary Tree
- leetcode 104: Maximum Depth of Binary Tree
- 关于solr建立json 多层嵌套复杂数据的第一种方法
- python07集合
- 使用padding-top需要注意一些问题
- 面对对象的三个基本特征(继承)(this和super)
- Drupal--plupload模块
- 【LeetCode】104 Maximum Depth of Binary Tree
- leetcode-4-Median of Two Sorted Arrays
- 2017暑假集训 div1 连通图(2)
- “玲珑杯”ACM比赛 Round #18 C -- 图论你先敲完模板
- 判断链表是否有交点若有找出交点
- JSON详细学习之Gson in JAVA
- 适配器模式
- 冒泡排序简单改进
- python基础之异常处理、调试和正则表达式