zoukankan      html  css  js  c++  java
  • leecode 543. 二叉树的直径

    /*
     * 543. Diameter of Binary Tree
     * 题意:树中的最长路径
     * 难度:Easy
     * 分类:Tree
     * 思路:和lc124思路一样,但lc124是Hard,这道竟然是Easy,哈哈哈
     * Tips:
     */
    public class lc543 {
        public class TreeNode {
            int val;
            TreeNode left;
            TreeNode right;
            TreeNode(int x) { val = x; }
        }
        int max = 0;
        public int diameterOfBinaryTree(TreeNode root) {
            helper(root);
            return max;
        }
        public int helper(TreeNode root){
            if(root==null)
                return 0;
            int left = helper(root.left);
            int right = helper(root.right);
            max = Math.max(left+right, max);
            return Math.max(left, right)+1;
        }
    }
  • 相关阅读:
    sqhhb
    12333
    12

    今日份
    12
    彻底理解 Cookie、Session、Token
    https原理
    12312
    uiower
  • 原文地址:https://www.cnblogs.com/kpwong/p/14658331.html
Copyright © 2011-2022 走看看