题目:
代码(首刷自解 2024年3月5日):
/**
* 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 = 0;
int NodeVal(TreeNode* root) {
if (!root) return -1;
int left = NodeVal(root->left) + 1;
int right = NodeVal(root->right) + 1;
int large = max(left, right);
res = max(res, left + right);
return large;
}
int diameterOfBinaryTree(TreeNode* root) {
if (!root) return 0;
NodeVal(root);
return res;
}
};