leetcode経典プログラミング問題(1)
1862 ワード
, , , 。
, leetcode , Java 。
(1) minimum-depth-of-binary-tree
:
: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.
。
: , , 。 , 。
:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
```
```
public class Solution {
public int run(TreeNode root) {
if(root == null){
return 0;
}
int left = run(root.left);
int right = run(root.right);
if(left == 0){
return 1+right;
}else if(right == 0){
return 1+left;
}else{
return Math.min(1+left,1+right);
}
}
}