112. Path Sum（python+cpp）

题目：

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，经典的dfs题目。而且这道题不需要额外再写一个dfs函数并把path作为参数了，直接把对原函数做递归就好。
python代码：

# 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
        elif not root.left and not root.right:
            return sum==root.val
        left,right=False,False
        if root.left:
            left=self.hasPathSum(root.left,sum-root.val)
        if root.right:
            right=self.hasPathSum(root.right,sum-root.val)
        return left or right

c++代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {
        
        if (!root)
            return false;
        else if(!root->left && !root->right)
            return sum==root->val;
        bool left=false,right=false;
        if(root->left)
            left=hasPathSum(root->left,sum-root->val);
        if (root->right)
            right=hasPathSum(root->right,sum-root->val);
        return left ||right;
    }
};

总结：
能在原函数解决的递归问题，就无需再另外写一个函数了。