zoukankan      html  css  js  c++  java
  • Java实现LeetCode 111. Minimum Depth of Binary Tree

    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }
     * }
     */
    class Solution {
        public int minDepth(TreeNode root) {
            if(root == null){
                return 0;
            }
            if((root.left == null) && (root.right == null)){
                return 1;
            }
            int min_depth = Integer.MAX_VALUE;
            if(root.left != null){
                min_depth = Math.min(minDepth(root.left),min_depth);
            }
            if(root.right != null){
                min_depth = Math.min(minDepth(root.right),min_depth);
            }
            return min_depth+1;
        }
    }
    
  • 相关阅读:
    PCA
    Less
    Node.js的运行
    跨域
    Jquery中的Ajax
    JSON
    Ajax应用查询员工信息
    xampp中localhost与DreamWaver站点设置问题
    PHP
    HTTP是什么
  • 原文地址:https://www.cnblogs.com/a1439775520/p/12947025.html
Copyright © 2011-2022 走看看