lintcode刷体记录
题目:
答案
/**
* Definition of TreeNode:* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param root: The root of binary tree.
* @return: An integer.
*/
public int minDepth(TreeNode root) {
// write your code here
if(root == null)
return 0;
int leftLen = 0;
int flag = 1;
int rightLen = 0;
int len = 1;
TreeNode left = root.left;
TreeNode right = root.right;
leftLen = minDepth(left);
rightLen = minDepth(right);
/*
*只有右子树,左子树为空
*/
if(leftLen == 0 && rightLen !=0){
len += rightLen;
}else if(leftLen != 0 && rightLen==0){ //右子树空,左子树非空
len += leftLen;
}else{//左子树非空、右子树非空
len += leftLen > rightLen ? rightLen:leftLen;
}
return len;
}
}