LeetCode - Minimum Depth of Binary Tree
求二叉树的最小深度。
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public int minDepth(TreeNode root) { if(root == null) return 0; int l = minDepth(root.left); int r = minDepth(root.right); if(l==0) return r+1; else if(r==0) return l+1; else return r<l? r+1:l+1; } }
谁能告诉我下面这个代码错在哪里了?
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public static int MIN = 9999999; public static int minDepth(TreeNode root) { if(root == null) return 0; dfs(root, MIN, 1); return MIN; } public static void dfs(TreeNode root, int min, int cnt) { if(root == null) return ; if(root.left==null && root.right==null) { if(min > cnt) { min = cnt; MIN = min; } return ; } dfs(root.left, min, cnt+1); dfs(root.right, min, cnt+1); return ; } }
作者:Pickle
声明:对于转载分享我是没有意见的,出于对博客园社区和作者的尊重一定要保留原文地址哈。
致读者:坚持写博客不容易,写高质量博客更难,我也在不断的学习和进步,希望和所有同路人一道用技术来改变生活。觉得有点用就点个赞哈。
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112835275-168981902.gif)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112841431-2047172832.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112847494-1544911856.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112904385-918783221.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111120143119-1302805212.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112856369-1466718103.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112830416-794416355.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111113919510-1155220901.gif)