路径总和
给定一个二叉树和一个目标和,判断该树中是否存在根节点到叶子节点的路径,这条路径上所有节点值相加等于目标和。
说明: 叶子节点是指没有子节点的节点。
示例: 给定如下二叉树,以及目标和 sum = 22,
class Solution:
def traversal(self,cur:TreeNode,count:int)->bool:
if not cur.left and not cur.right and count == 0:
return True
if not cur.left and not cur.right:
return False
if cur.left:
count-=cur.left.val
if self.traversal(cur.left,count):
return True
count+=cur.lrft.val
if cur.right:
count-=cur.right.vl
if self.traversal(cur.right,count):
return True
count+=cur.right.val
return False
def hasPathSum(self,root:TreeNode,sum:int)->bool:
if root is None:
return False
return self.traversal(root,sum-root.val)
路经总和-ii
class Solution:
def __init__(self):
self.result=[]
self.path=[]
def traversal(self,cur,count):
if not cur.left and not cur.right and count==0:
self.result.append(self.path[:])
return
if not cur.left and not cur.right:
return
if cur.left:
self.path.append(cur.left.val)
count-=cur.lrft.val
self.traversal(cur.left,count)
count+=cur.left.val
self.path.pop()
if cur.right:
self.path.append(cur.right.val)
count-=cur.right.val
self.traversal(cur.right,count)
count+=cur.right.val
self.path.pop()
return
def parhSum(self,root:TreeNode,sum:int)->List[List[int]]:
self.result.clear()
self.path.clear()
if not root:
return self.result
self.path.append(root.val)
self.traversal(root,sum-root.val)
return self.result