mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-05-06 08:45:11 -04:00
👾
This commit is contained in:
parent
1d44d182e2
commit
a85ed914d3
320 changed files with 0 additions and 0 deletions
25
trees/has_path_sum.py
Normal file
25
trees/has_path_sum.py
Normal file
|
@ -0,0 +1,25 @@
|
|||
#!/usr/bin/env python3
|
||||
# -*- coding: utf-8 -*-
|
||||
# author: bt3gl
|
||||
|
||||
def has_path_sum(root: Optional[TreeNode], target_sum: int) -> bool:
|
||||
|
||||
def transverse(node, sum_here=0):
|
||||
|
||||
if not node:
|
||||
return sum_here == target_sum
|
||||
|
||||
sum_here += node.val
|
||||
|
||||
if not node.left:
|
||||
return transverse(node.right, sum_here)
|
||||
if not node.right:
|
||||
return transverse(node.left, sum_here)
|
||||
else:
|
||||
return transverse(node.left, sum_here) or transverse(node.right, sum_here)
|
||||
|
||||
if not root:
|
||||
return False
|
||||
|
||||
return transverse(root)
|
||||
|
Loading…
Add table
Add a link
Reference in a new issue