leetcode112 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.
使用深度优先遍历，递归的结束条件需要好好考虑一下

下面是代码：

/**
 * 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) {

        bool re = false;
        hasPathSum(root, sum, re);

        return re;
    }

    // 因为需要考虑当首节点是空节点的时候的情况，所以使用一个辅助函数
    void hasPathSum(TreeNode* root, int sum, bool &re){

        if(!root) return;

        if(!root->left && !root->right && sum == root->val) {
            re = true;
            return;
        }

        bool re1 = false; 
        bool re2 = false;
        hasPathSum(root->left, sum - root->val, re1);
        hasPathSum(root->right, sum - root->val, re2);

        re = re1 || re2;   

        return;
    }
};