@@ -0,0 +1,693 @@
+package me.wayne.leetcodetop100.binarytree;%0A%0Aimport me.wayne.leetcodetop100.TreeNode;%0A%0A/**%0A * %E7%BB%99%E5%AE%9A%E4%B8%80%E4%B8%AA%E4%BA%8C%E5%8F%89%E6%A0%91%EF%BC%8C%E6%89%BE%E5%87%BA%E5%85%B6%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6%E3%80%82%0A * %3Cp%3E%0A * %E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6%E6%98%AF%E4%BB%8E%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E6%9C%80%E8%BF%91%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E4%B8%8A%E7%9A%84%E8%8A%82%E7%82%B9%E6%95%B0%E9%87%8F%E3%80%82%0A * %3Cp%3E%0A * https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/%0A */%0Apublic class LC111_MinDepth %7B%0A%0A    public int minDepth(TreeNode root) %7B%0A        if (root == null) %7B%0A            return 0;%0A        %7D else %7B%0A            int left = minDepth(root.left);%0A            int right = minDepth(root.right);%0A%0A            if (left == 0) %7B%0A                return right + 1;%0A            %7D else if (right == 0) %7B%0A                return left + 1;%0A            %7D else %7B%0A                return Math.min(left, right) + 1;%0A            %7D%0A        %7D%0A    %7D%0A%7D%0A

add LC111_MinDepth