void helper(TreeNode *root,unsigned int curDepth,unsigned int *minDepth) { if(curDepth>=*minDepth-1) return; curDepth++; if(!root->left&&!root->right) { *minDepth = curDepth; return; }else { if(root->left) helper(root->left,curDepth,minDepth); if(root->right) helper(root->right,curDepth,minDepth); } } int minDepth(TreeNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function if(!root) return 0; unsigned int minDepth = (unsigned int)-1; helper(root,0,&minDepth); return minDepth; }
second_time:
int minDepth(TreeNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function if(!root) return 0; if(!root->left&&!root->right) return 1; int ld = INT_MAX,rd = INT_MAX; if(root->left) ld = minDepth(root->left); if(root->right) rd = minDepth(root->right); return min(ld,rd)+1; }
原文链接: https://www.cnblogs.com/summer-zhou/archive/2013/05/29/3106250.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/90479
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!