[leetcode: Python]112. 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.

判断给定二叉树是否存在路径，使得路径上的值之和等于给定值。

方法一：性能72ms

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

class Solution(object):
    def hasPathSum(self, root, sum):
        """
        :type root: TreeNode
        :type sum: int
        :rtype: bool
        """
        ret = False
        if root == None:
            return ret
        sum -= root.val
        if sum == 0 and root.left == None and root.right == None:
            ret = True
        return ret or self.hasPathSum(root.left, sum) or self.hasPathSum(root.right, sum)

方法二：性能58ms

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

class Solution(object):
    def hasPathSum(self, root, sum):
        """
        :type root: TreeNode
        :type sum: int
        :rtype: bool
        """
        if not root:
            return False
        return self.helper(root, 0, sum)

    def helper(self, root, total, sum):
        if not root:
            return False
        total += root.val
        if not root.left and not root.right:
            if total != sum:
                return False
            else: 
                return True
        return self.helper(root.left, total, sum) or self.helper(root.right, total, sum)