leetcode:Maximum Depth of Binary Tree 【Java】
来源:互联网 发布:js 点击后显示内容 编辑:程序博客网 时间:2024/04/29 16:45
一、问题描述
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
二、问题分析
利用递归思想。
三、算法代码
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int maxDepth(TreeNode root) { if(root == null){ return 0; } int left = maxDepth(root.left); int right = maxDepth(root.right); return Math.max(left, right) + 1; }}
0 0
- [Leetcode] Maximum Depth of Binary Tree (Java)
- [LeetCode][Java] Maximum Depth of Binary Tree
- LeetCode|Maximum Depth of Binary Tree-java
- (java)leetcode Maximum Depth of Binary Tree
- leetcode:Maximum Depth of Binary Tree 【Java】
- Leetcode - Tree - Maximum Depth of Binary Tree
- [leetcode][tree] Maximum Depth of Binary Tree
- 【leetcode】【Maximum Depth of Binary Tree】java stack类
- Leetcode:104. Maximum Depth of Binary Tree(JAVA)
- LeetCode 104 Maximum Depth of Binary Tree JAVA
- leetcode Maximum Depth of Binary Tree java实现
- LeetCode 104 -Maximum Depth of Binary Tree ( JAVA )
- 【Leetcode】:104. Maximum Depth of Binary Tree 问题 in JAVA
- leetcode-java-104. Maximum Depth of Binary Tree
- LeetCode之Maximum Depth of Binary Tree(Java版)
- [LeetCode-104]Maximum Depth of Binary Tree (java)
- LeetCode 104. Maximum Depth of Binary Tree java soluiton
- [leetcode]104. Maximum Depth of Binary Tree@Java解题报告
- CString 和 LPCTSTR等之间的转换大全
- [springmvc]返回ModelAndView,视图解析不到jsp,而是去解析“'请求路径'+ ‘.jsp’”
- 18. 4Sum
- Create Enterprise Geodatabase创建企业级地理数据库
- Linux下压缩/解压方法大全
- leetcode:Maximum Depth of Binary Tree 【Java】
- CocoaPods的使用
- DB --- Oracle 入门教程基本知识
- “蜥蜴之尾”——长老木马四代分析报告
- 查看Eclipse版本号,及各个版本区别
- git命令整理
- Fresco使用介绍
- Chrome内核使用parseFromString无法获取a的href
- 【error】npm install报错