543. Diameter of Binary Tree
发布时间:2020-12-14 04:49:17 所属栏目:大数据 来源:网络整理
导读:/* * * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x),left(NULL),right(NULL) {} * }; */ class Solution { public : int res = 0 ; int diameterOfBinaryTree(Tre
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x),left(NULL),right(NULL) {} * }; */ class Solution { public: int res = 0; int diameterOfBinaryTree(TreeNode* root) { helper(root); return res; } int helper(TreeNode* root) { if (root == NULL) return 0; int left = helper(root->left) + 1; int right = helper(root->right) + 1; res = max(res,left+right-2); return max(left,right); } }; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |