LeetCode 543. 二叉树的直径

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int res;
    int depth(TreeNode* root){
        if(!root){
            return 0;
        }
        int l = depth(root->left);
        int r = depth(root->right);
        res = max(res, l + r + 1);  //更新最大长度
        return max(l, r) + 1;   //返回以当前节点为根节点的最大高度
    }
    int diameterOfBinaryTree(TreeNode* root) {
        res = 1;
        depth(root);
        return res - 1; //长度是节点数-1
    }
};