543. Diameter of Binary Tree
题目要算树最远两个节点的间隔
我就烂递回算树左右高然后加起来
再递回把整个树的节点都算一次
超慢速才赢6.96％
class Solution:
def diameterOfBinaryTree(self, root: Optional[TreeNode]) -> int:
def Tree_height(root):
if root is not None:
return max(Tree_height(root.left), Tree_height(root.right)) +
1
else:
return 0
if root is not None:
path_length = Tree_height(root.left) + Tree_height(root.right)
return max(path_length, self.diameterOfBinaryTree(root.left),
self.diameterOfBinaryTree(root.right))
else:
return 0