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 69aea6b

Browse files
Create Solution.py
1 parent edae349 commit 69aea6b

File tree

1 file changed

+6
-0
lines changed

1 file changed

+6
-0
lines changed

‎Deepest Leaves Sum/Solution.py

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
class Solution:
2+
def deepestLeavesSum(self, root: TreeNode) -> int:
3+
curr = [root]
4+
while curr:
5+
prev, curr = curr, [child for p in curr for child in [p.left, p.right] if child]
6+
return sum(node.val for node in prev)

0 commit comments

Comments
(0)

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