leetcode 112
2021-02-27 本文已影响0人
七齐起器
class Solution(object):
def hasPathSum(self, root, targetSum):
if root == None:
return False
if root.left == None and root.right == None:
return root.val == targetSum
return self.hasPathSum(root.right, targetSum - root.val) or self.hasPathSum(root.left, targetSum - root.val)
