【LeetCode】【HOT】543. 二叉树的直径（递归）

【LeetCode】【HOT】543. 二叉树的直径

package hot;

class TreeNode{
    int val;
    TreeNode left;
    TreeNode right;

    TreeNode(int val){
        this.val = val;
    }
}

public class Solution543 {
    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(1);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(3);
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        node1.left = node2;
        node1.right = node3;
        node2.left = node4;
        node2.right = node5;
        Solution543 solution = new Solution543();
        System.out.println(solution.method(node1));
    }

    int res;

    private int method(TreeNode root){
        res = 1;
        recur(root);
        return res - 1;
    }

    private int recur(TreeNode root){
        if(root == null){
            return 0;
        }
        int L = recur(root.left);
        int R = recur(root.right);
        res = Math.max(res, L+R+1);
        return Math.max(L, R) + 1;
    }
}

//时间复杂度为 O(n)
//空间复杂度为 O(n)