112. Path Sum Python

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,

      5
     / \
    4   8
   /   / \
  11  13  4
 /  \      \
7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

首先简单看下题目，是找到一个路径上节点的总值是否和给定的sum相等

思路：我们只需要遍历整棵树并记录下所有得到路径上节点的总值，最后用in确认就可以了。不过下面采用更简洁一点的写法，在每次到了叶子节点的时候就判断总路径的值和sum是否相等。

以下是Python解法

class Solution:
    def hasPathSum(self, root, sum):
        
        if not root:#
            return False
        stack = [(root,root.val)]
        while stack:
            node,node.val = stack.pop()
            if not node.left and not node.right:#意味着已经是在最底部了
                if node.val == sum:
                    return True
            if node.left:#第二个参数在每一次迭代过程中都添加节点的值
                stack.append((node.left,node.val+node.left.val))
            if node.right:
                stack.append((node.right,node.val+node.right.val))
        return False