Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents df20072 + 515f1bf commit 6aecc8cCopy full SHA for 6aecc8c
python/543-Diameter-of-Binary-Tree.py
@@ -5,17 +5,19 @@
5
# self.left = left
6
# self.right = right
7
class Solution:
8
- def diameterOfBinaryTree(self, root: TreeNode) -> int:
9
- res = [0]
+ def diameterOfBinaryTree(self, root: Optional[TreeNode]) -> int:
+ res = 0
10
11
def dfs(root):
12
+ nonlocal res
13
+
14
if not root:
- return -1
15
+ return 0
16
left = dfs(root.left)
17
right = dfs(root.right)
- res[0] = max(res[0], 2 + left + right)
18
+ res = max(res, left + right)
19
20
return 1 + max(left, right)
21
22
dfs(root)
- return res[0]
23
+ return res
0 commit comments