[LeetCode]111. Minimum Depth of Binary Tree
来源：互联网 发布：mac层随机竞争算法 编辑：程序博客网 时间：2024/06/13 22:22
题目描述：Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
分析：查找一棵二叉树从根节点到叶子节点的最短距离
解题思路:类似于求二叉树的深度，但是因为是求二叉树的最小深度，所以返回的是左子树和右子树中最小的深度。
public int minDepth(TreeNode root) { if(root==null)return 0; if(root.left==null)return minDepth(root.right)+1; if(root.right==null)return minDepth(root.left)+1; return Math.min(minDepth(root.left), minDepth(root.right))+1; }阅读全文
0 0
- LeetCode 111. Minimum Depth of Binary Tree
- [LeetCode]111.Minimum Depth of Binary Tree
- 【LeetCode】111.Minimum Depth of Binary Tree
- [Leetcode] 111. Minimum Depth of Binary Tree
- [leetcode] 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree LeetCode
- 【LeetCode】111. Minimum Depth of Binary Tree
- LeetCode *** 111. Minimum Depth of Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree
- leetcode-111. Minimum Depth of Binary Tree
- LeetCode-111.Minimum Depth of Binary Tree
- LeetCode 111.Minimum Depth of Binary Tree
- Leetcode 111. Minimum Depth of Binary Tree
- [leetcode]111.Minimum Depth of Binary Tree
- 111.[Leetcode]Minimum Depth of Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree
- 【leetcode】111. Minimum Depth of Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree
- 肤色检测与分割方法
- linux下copy文件时出现cp: omitting directory的报错
- ASP.NET WebAPi之断点续传下载（上）
- Net使用Microsoft.Office.Interop.Excel;创建Excel文件（插入数据、修改格式、生成图表）的方法，以及Excel查看加密
- pyQt5-拖拽
- [LeetCode]111. Minimum Depth of Binary Tree
- (M)Backtracking:39. Combination Sum
- Python 入门知识
- Python入门（2）
- 微信小程序 —— 自定义带进度条的音频播放控件audio
- 3-8 跳跃步数
- springboot访问页面报错：This application has no explicit mapping for /error, so you are seeing this as a fa
- 关于缘起
- Android微信之简单文本分享(集成官方SDK-Android Studio)
