Leetcode #111 Minimum Depth of Binary Tree
来源：互联网 发布：比尔盖茨 人工智能 编辑：程序博客网 时间：2024/05/22 21:49
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.
Difficulty:Easy
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: int cal(int dep,TreeNode* root){ if(root==NULL) return 2147483647; if(root->left==NULL&&root->right==NULL) return 1+dep; return min(cal(dep+1,root->left),cal(dep+1,root->right)); } int minDepth(TreeNode* root) { if(root==NULL) return 0; if(root->left==NULL&&root->right==NULL) return 1; int ans = 2147483647; ans = min(ans,cal(1,root->left)); ans = min(ans,cal(1,root->right)); return ans; }}; 0 0
- LeetCode(111)Minimum Depth of Binary Tree
- LeetCode: Minimum Depth of Binary Tree [111]
- 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
- 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
- Go开发工具
- Cool Android Apis 整理（二）
- 正则表达式
- eclipse properties中文乱码
- django安装tinymce
- Leetcode #111 Minimum Depth of Binary Tree
- SecureCRT中文显示乱码
- LeetCode -- Path Sum ||
- android使用socket使底层和framework通信
- 如何将json数据传入到Highcharts中的data中
- beanstalkd介绍
- runtime 运行时机制 完全解读
- HDU 5371 Hotaru's problem （Manacher+暴力）
- 转载 唤醒后台命令
