zoukankan      html  css  js  c++  java
  • lintcode97- Maximum Depth of Binary Tree- easy

    Given a binary tree, find its maximum depth.

    The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

    Example

    Given a binary tree as follow:

      1
     /  
    2   3
       / 
      4   5
    

    The maximum depth is 3.

    分治法做。本层高度就是max(左高度,右高度) +1。出口是null->0。

    /**
     * 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 maxDepth(TreeNode root) {
            // write your code here
            if (root == null){
                return 0;
            }
    
            int leftDepth = maxDepth(root.left) + 1;
            int rightDepth = maxDepth(root.right) + 1;
    
            return Math.max(leftDepth, rightDepth);
        }
    }
  • 相关阅读:
    正则表达式(二)
    HTTP状态码
    ajax(局部刷新技术)
    day03<JS对象&函数>
    day02<CSS&JavaScript>
    day01<HTML等>
    总结:HTML表单的应用
    总结:HTML的框架结构
    九、浮动与定位
    八、CSS高级技巧
  • 原文地址:https://www.cnblogs.com/jasminemzy/p/7659161.html
Copyright © 2011-2022 走看看