Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 5e49aa9

Browse files
Create 1302.py
1 parent f6347e0 commit 5e49aa9

File tree

1 file changed

+26
-0
lines changed

1 file changed

+26
-0
lines changed

‎1001-1500/1302.py‎

Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
# Definition for a binary tree node.
2+
# class TreeNode:
3+
# def __init__(self, val=0, left=None, right=None):
4+
# self.val = val
5+
# self.left = left
6+
# self.right = right
7+
class Solution:
8+
def __init__(self):
9+
self.deepest = float('-inf')
10+
self.res = 0
11+
12+
def deepestLeavesSum(self, root: Optional[TreeNode]) -> int:
13+
def dfs(root, level):
14+
if not root:
15+
return
16+
if level>self.deepest:
17+
self.res = root.val
18+
self.deepest = level
19+
elif level ==self.deepest:
20+
self.res += root.val
21+
dfs(root.left,level+1)
22+
dfs(root.right,level+1)
23+
24+
dfs(root,0)
25+
return self.res
26+

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /