112. Path Sum [easy] (Python)

题目链接

https://leetcode.com/problems/path-sum/

题目原文

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.

For 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，判断这个树是否有一条从根到叶的路径，这条路径上所有数之和为sum。比如，给定sum=22，二叉树为：

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

那么应该返回true，因为存在路径 5->4->11->2 ，其和为22。

思路方法

思路一

用深度优先搜索（DFS）遍历所有可能的从根到叶的路径，要注意每深一层要从和中减去相应节点的数值。下面是递归实现的代码。

代码

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x