LeetCode---Maximum Depth of Binary Tree
来源:互联网 发布:淘宝商品宣传视频 编辑:程序博客网 时间:2024/06/08 00:21
Maximum Depth of Binary Tree
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.
题目要求:
给定一个二叉树,找到它的最大深度。最大深度是指从根节点到最远子节点的节点个数。
解题思路:
解决这个问题可以使用递归的思想,这种想法简单而清晰。
Solution:
/** * Definition for binary tree * 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 nLeftDeep = maxDepth(root.left); int nRightDeep = maxDepth(root.right); return 1+Math.max(nLeftDeep,nRightDeep); } }
0 0
- Leetcode - Tree - Maximum Depth of Binary Tree
- [leetcode][tree] Maximum Depth of Binary Tree
- LeetCode Maximum Depth of Binary Tree
- [Leetcode] Maximum Depth of Binary Tree
- leetcode 24: Maximum Depth of Binary Tree
- [LeetCode] Maximum Depth of Binary Tree
- Leetcode 104 Maximum Depth of Binary Tree
- 【leetcode】Maximum Depth of Binary Tree
- [leetcode]Maximum Depth of Binary Tree
- [LeetCode]Maximum Depth of Binary Tree
- [leetcode]Maximum Depth of Binary Tree
- Leetcode: Maximum Depth of Binary Tree
- LeetCode-Maximum Depth of Binary Tree
- [leetcode] Maximum Depth of Binary Tree
- LeetCode - Maximum Depth of Binary Tree
- LeetCode:Maximum Depth of Binary Tree
- LeetCode | Maximum Depth of Binary Tree
- 【leetcode】Maximum Depth of Binary Tree
- spring mvc 使用jsr-303 @Valid实现bean的字段验证
- 几种开源的TCP/IP协议栈分析
- 宽屏模板做法 - 自适应页面
- 构建ASP.NET MVC4+EF5+EasyUI+Unity2.x注入的后台管理系统(29)-T4模版
- html转pdf文件
- LeetCode---Maximum Depth of Binary Tree
- 修改围绕float的文本
- ${requestScope.}与request.getParameter区别?
- http://www.cnblogs.com/amosli/p/3577645.html
- QQ在线客服
- 连接MYSQL时,主机名为localhost和127.0.0.1的区别
- 通过线程监控Java进程,完成attach agent
- C语言几种排序算法比较
- 第四次作业