使用宽搜,当搜到第一个叶子节点的时候,直接返回。
但是注意仍旧要在最后面返回一个值,不然会报错。
BFS版
/**
* 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 minDepth(TreeNode* root) {
if(!root) return 0;
queue<TreeNode*> q;
q.push(root);
int cnt = 0;
while(q.size()){
cnt++;
int len = q.size();
for(int j = 0; j < len; j++){
auto t = q.front();
q.pop();
if(!t->left && !t->right) return cnt;
if(t->left) q.push(t->left);
if(t->right) q.push(t->right);
}
}
return cnt;
}
};
递归版
class Solution {
public:
int run(TreeNode *root) {
if(root == 0) return 0;
if(!root->left && !root->right) return 1;
if(!root->left || !root->right) return max(run(root->left), run(root->right)) + 1;
return min(run(root->left), run(root->right)) + 1;
}
};