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.
1 parent 9f0e528 commit 24d6856Copy full SHA for 24d6856
leetcode.com 129. Sum Root to Leaf Numbers/main.py
@@ -0,0 +1,29 @@
1
+from typing import Optional
2
+
3
4
+# Definition for a binary tree node.
5
+class TreeNode:
6
+ def __init__(self, val=0, left=None, right=None):
7
+ self.val = val
8
+ self.left = left
9
+ self.right = right
10
11
12
+class Solution:
13
+ def __init__(self):
14
+ self.answer = 0
15
16
+ def sumNumbers(self, root: Optional[TreeNode]) -> int:
17
+ self.dfs(root, 0)
18
+ return self.answer
19
20
+ def dfs(self, node: Optional[TreeNode], v):
21
+ if node.left is None and node.right is None:
22
+ self.answer += (v * 10 + node.val)
23
+ return
24
25
+ if node.left:
26
+ self.dfs(node.left, v * 10 + node.val)
27
28
+ if node.right:
29
+ self.dfs(node.right, v * 10 + node.val)
0 commit comments