LeetCode 104. Maximum Depth of Binary Tree 题解
来源:互联网 发布:在线看熊片的软件 编辑:程序博客网 时间:2024/05/01 18:32
题目链接:https://leetcode.com/problems/maximum-depth-of-binary-tree/?tab=Description
思路:二叉树的最大深度= max{ 左子树的最大深度,右子树的最大深度} + 1
Java代码如下:
public class Solution {// 二叉树的最大深度等于max {左子树的最大深度,右子树的最大深度} + 1 public int maxDepth(TreeNode root) { if(root == null){ return 0; } return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1; }}
0 0
- LeetCode题解:Maximum Depth of Binary Tree
- LeetCode题解:Maximum Depth of Binary Tree
- LeetCode题解:Maximum Depth of Binary Tree
- Leetcode题解 104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree 题解(C++)
- 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
- 104. Maximum Depth of Binary Tree LeetCode
- 104. Maximum Depth of Binary Tree LeetCode
- 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
- 爱拼宝宝,电商小程序
- UEFI启动模式下安装Ubuntu 16.04教程
- leet_257. Binary Tree Paths-根到叶子的路径
- 数据结构实验之链表九:双向链表
- [博弈论] cf317 D Game with Powers
- LeetCode 104. Maximum Depth of Binary Tree 题解
- 今天开始陆陆续续写博客,做更优秀的程序员
- maven的安装
- Python EOF 的错误
- 码
- 最熟悉的陌生属性——position
- 欢迎使用CSDN-markdown编辑器
- SCOI2012喵星球的点名--后缀数组
- windows7中 安装tensorflow